Zobrazeno 1 - 10
of 157
pro vyhledávání: '"PELTOMÄKI, JARKKO"'
Autor:
Peltomäki, Jarkko, Porres, Ivan
Black-box runtime verification methods for cyber-physical systems can be used to discover errors in systems whose inputs and outputs are expressed as signals over time and their correctness requirements are specified in a temporal logic. Existing met
Externí odkaz:
http://arxiv.org/abs/2410.03202
In 2014, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length $n$ contain $n$ distinct nonempty palindromic factors. In 2020, Currie, Mol, and Rampersad pr
Externí odkaz:
http://arxiv.org/abs/2409.12068
Autor:
Peltomäki, Jarkko, Porres, Ivan
We present the OGAN algorithm for automatic requirement falsification of cyber-physical systems. System inputs and output are represented as piecewise constant signals over time while requirements are expressed in signal temporal logic. OGAN can find
Externí odkaz:
http://arxiv.org/abs/2310.20493
WOGAN is an online test generation algorithm based on Wasserstein generative adversarial networks. In this note, we present how WOGAN works and summarize its performance in the SBST 2022 CPS tool competition concerning the AI of a self-driving car.
Externí odkaz:
http://arxiv.org/abs/2205.11064
We propose a novel online test generation algorithm WOGAN based on Wasserstein Generative Adversarial Networks. WOGAN is a general-purpose black-box test generator applicable to any system under test having a fitness function for determining failing
Externí odkaz:
http://arxiv.org/abs/2205.11060
Autor:
Peltomäki, Jarkko, Porres, Ivan
We consider the problem of falsifying safety requirements of Cyber-Physical Systems expressed in signal temporal logic (STL). This problem can be turned into an optimization problem via STL robustness functions. In this paper, our focus is in falsify
Externí odkaz:
http://arxiv.org/abs/2205.11057
Autor:
Peltomäki, Jarkko, Salo, Ville
Publikováno v:
Information and Computation, Vol. 285.B, 104883:1-21 (2022)
To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$ and $W(X)$
Externí odkaz:
http://arxiv.org/abs/2106.07249
Autor:
Peltomäki, Jarkko
Publikováno v:
European Journal of Combinatorics, Vol. 118, 103942:1-44 (2024)
Regular episturmian words are episturmian words whose directive words have a regular and restricted form making them behave more like Sturmian words than general episturmian words. We present a method to evaluate the initial nonrepetitive complexity
Externí odkaz:
http://arxiv.org/abs/2103.08351
The prefix palindromic length $\mathrm{PPL}_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. Since 2013, it is still unknown if $\mathrm{PP
Externí odkaz:
http://arxiv.org/abs/2009.02934