Related papers: Timed Automata with Polynomial Delay and their Exp…
Compartment models with delay terms are widely used across a range of disciplines. The motivation to include delay terms varies across different contexts. In epidemiological and pharmacokinetic models, the delays are often used to represent…
For the first time, using a modified Ikeda model it is demonstrated analytically that anticipating synchronization can be obtained in chaotic time-delay systems governed by two characteristic delay times. We derive existence and stability…
We write the relations that characterize the simpliest timed automaton, the inertial delay buffer, in two versions: the non-deterministic and the deterministic one, by making use of the derivatives of the R->{0,1} functions.
Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…
Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the…
Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. In this paper we develop a new model of…
In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the…
The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.
In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate. We then introduce a new clock update for timed automata…
The paper is concerned with defining the electrical signals and their models. The delays are discussed, the asynchronous automata - which are the models of the asynchronous circuits - and the examples of the clock generator and of the R-S…
We address the problem of verifying timed properties of Markovian models of large populations of interacting agents, modelled as finite state automata. In particular, we focus on time-bounded properties of (random) individual agents…
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…
Timed languages contain sequences of discrete events ("letters'') separated by real-valued delays, they can be recognized by timed automata, and represent behaviors of various real-time systems. The notion of bandwidth of a timed language…
Mathematical modeling based on time-delay differential equations is an important tool to study the role of delay in biological systems and to evaluate its impact on the asymptotic behavior of their dynamics. Delays are indeed found in many…
Dynamical systems with long delay feedback can exhibit complicated temporal phenomena, which once re-organized in a two-dimensional space are reminiscent of spatio-temporal behavior. In this framework, normal forms description have been…
Metric Temporal Logic can express temporally evolving properties with time-critical constraints or time-triggered constraints for real-time systems. This paper extends the Metric Interval Temporal Logic with a distribution eventuality…
We explore language semantics for automata combining probabilistic and nondeterministic behavior. We first show that there are precisely two natural semantics for probabilistic automata with nondeterminism. For both choices, we show that…
This paper continues the study of [11, 13] for stationary solutions of stochastic linear retarded functional differential equations with the emphasis on delays which appear in those terms including spatial partial derivatives. As a…
In this letter we introduce a class of delayed kinetic systems derived from mass action type reaction network models. We define the time delayed positive stoichiometric compatibility classes and the notion of complex balanced time delayed…
Timed automata are the formal model for real-time systems. Extensions with discrete probabilistic branching have been considered in the literature and successfully applied. Probabilistic timed automata (PTA) do require all branching…