Results 251 to 260 of about 17,423 (281)
Corrections to “A Menagerie of Timed Automata” [PDF]
ACM Computing Surveys, 2017 This note corrects a technical error in the ACM Computing Surveys article mentioned in the title. The flaw involved constructions for showing that timed automata with urgent locations have the same expressiveness as timed automata that allow false location invariants.
Keiren, J.J.A. +2 more
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Reachability in timed automata
ACM SIGLOG News, 2022Given a timed automaton A and a control state q , does there exist a run of A that visits q ? This problem of control state reachability in timed automata was posed in [Alur and Dill 1994] and is known to be PSPACE-complete. One does not hope to
openaire +1 more source
J. Autom. Lang. Comb., 2001
We study here the class of timed automata with a single clock which is reset at each transition. We adapt for these automata the classical results for finite automata: the Kleene Theorem, the closure under complementation and the Pumping Lemma. We provide an algorithm for the elimination of stuttering steps, which is essential in complementation. This
openaire +3 more sources
We study here the class of timed automata with a single clock which is reset at each transition. We adapt for these automata the classical results for finite automata: the Kleene Theorem, the closure under complementation and the Pumping Lemma. We provide an algorithm for the elimination of stuttering steps, which is essential in complementation. This
openaire +3 more sources
On simplification of timed automata
2016 IEEE East-West Design & Test Symposium (EWDTS), 2016In this paper we consider two properties of timed automata, which help to reduce their complexity. We understand complexity as the number of time variables associated with a given timed automaton. The first property concerns redundant time variables and the second — timed automata composition.
openaire +1 more source
2013
This paper proposes a new timed model named nested timed automata (NeTAs). A NeTA is a pushdown system whose stack symbols are timed automata (TAs). It either behaves as the top TA in the stack, or switches from one TA to another by pushing, popping, or changing the top TA of the stack. Different from existing component-based context-switch models such
Guoqiang Li 0001 +3 more
openaire +1 more source
This paper proposes a new timed model named nested timed automata (NeTAs). A NeTA is a pushdown system whose stack symbols are timed automata (TAs). It either behaves as the top TA in the stack, or switches from one TA to another by pushing, popping, or changing the top TA of the stack. Different from existing component-based context-switch models such
Guoqiang Li 0001 +3 more
openaire +1 more source
1998
We examine some extensions of the basic model, due to Alur and Dill, of real-time automata (RTA). Our model, controlled real-time automata, is a parameterized family of real-time automata with some additional features like clock stopping, variable clock velocities and periodic tests.
François Demichelis, Wieslaw Zielonka
openaire +1 more source
We examine some extensions of the basic model, due to Alur and Dill, of real-time automata (RTA). Our model, controlled real-time automata, is a parameterized family of real-time automata with some additional features like clock stopping, variable clock velocities and periodic tests.
François Demichelis, Wieslaw Zielonka
openaire +1 more source
2005
We study the class of timed automata called eventual timed automata (ETA's) obtained using guards based on the operator $\Diamond$. In this paper we show that ETA's form a decidable class of timed automata via a flattening to non-recursive ETA's followed by a reduction to 1-clock alternating timed automata. We also study the expressiveness of the class
Deepak D'Souza, M. Raj Mohan
openaire +1 more source
We study the class of timed automata called eventual timed automata (ETA's) obtained using guards based on the operator $\Diamond$. In this paper we show that ETA's form a decidable class of timed automata via a flattening to non-recursive ETA's followed by a reduction to 1-clock alternating timed automata. We also study the expressiveness of the class
Deepak D'Souza, M. Raj Mohan
openaire +1 more source
1992
We propose timed automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words — strings in which a real-valued time of occurrence is associated with each ...
Rajeev Alur, David L. Dill
openaire +1 more source
We propose timed automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words — strings in which a real-valued time of occurrence is associated with each ...
Rajeev Alur, David L. Dill
openaire +1 more source
1997
We define robust timed automata, which are timed automata that accept all trajectories “robustly”: if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also.
Vineet Gupta 0001 +2 more
openaire +1 more source
We define robust timed automata, which are timed automata that accept all trajectories “robustly”: if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also.
Vineet Gupta 0001 +2 more
openaire +1 more source
1996
The relation between the Ada tasking model and the formal model timed automatonis described. Guidelines fortranslatingAdatasking constructs into timed automata and vice versa are given, along with important differences and similarities in tasking semantics between Ada task and timed automata.
openaire +1 more source
The relation between the Ada tasking model and the formal model timed automatonis described. Guidelines fortranslatingAdatasking constructs into timed automata and vice versa are given, along with important differences and similarities in tasking semantics between Ada task and timed automata.
openaire +1 more source