Related papers: Timed Automata with Polynomial Delay and their Exp…
The data generated by long-delayed dynamical systems can be organized in patterns by means of the so-called spatio-temporal representation, uncovering the role of multiple time-scales as independent degrees of freedom. However, their…
We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is exponential in the number of clocks. Our method is polynomial:…
This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL$^*$). We show that it is undecidable for these problems.…
In this study we show how to represent a continuous time autoregressive moving average (CARMA) as a higher order stochastic delay differential equation, which may be thought of as a continuous-time equivalent of the AR($\infty$)…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
We analyze Optimal Velocity Model (OVM) with explicit delay. The properties of congestion and the delay time of car motion are investigated by analytical and numerical methods. It is shown that the small explicit delay time has almost no…
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
Characterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods. While complete…
Polynomial stability of exact solution and modified truncated Euler-Maruyama method for stochastic differential equations with time-dependent delay are investigated in this paper. By using the well known discrete semimartingale convergence…
Distributed control algorithms are known to reduce overall computation time compared to centralized control algorithms. However, they can result in inconsistent solutions leading to the violation of safety-critical constraints. Inconsistent…
We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is interpreted in terms of biological systems, and biologically…
In this paper, we analyse the impact of delayed event detection on the stability of a 2-mode planar hybrid automata. We consider hybrid automata with a unique equilibrium point for all the modes, and we find the maximum delay that preserves…
Mathematical models of interacting populations are often constructed as systems of differential equations, which describe how populations change with time. Below we study one such model connected to the nonlinear dynamics of a system of…
The aim of this paper is to study the dynamical behavior of non-autonomous stochastic hybrid systems with delays. By general Krylov-Bogolyubov's method, we first obtain the sufficient conditions for the existence of an evolution system of…
A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a finite number of given features. Depending on its feature expression, each individual transition…
Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can…
Dynamical systems can autonomously adapt their organization so that the required target dynamics is reproduced. In the previous Rapid Communication [Phys. Rev. E 90,030901(R) (2014)], it was shown how such systems can be designed using…
We consider the scattering by a one-dimensional random potential and derive the probability distribution of the corresponding Wigner time delay. It is shown that the limiting distribution is the same for two different models and coincides…
Being a fully automated technique for resource analysis, automatic amortized resource analysis (AARA) can fail in returning worst-case cost bounds of programs, fundamentally due to the undecidability of resource analysis. For programmers…