. We propose timed (finite) automata to model the behavior of realtime systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many realvalued clocks . A timed automaton accepts timed words --- infinite sequences in which a real-valued time of occurrence is associated with each symbol. We study timed automata from the perspective of formal language theory: we consider closure properties, decision problems, and subclasses. We consider both nondeterministic and deterministic transition structures, and both Buchi and Muller acceptance conditions. We show that nondeterministic timed automata are closed under union and intersection, but not under complementation, whereas deterministic timed Muller automata are closed under all Boolean operations. The main construction of the paper is an (PSPACE) algorithm for checking the emptiness of the language of a (nondeterministic) timed automaton. We also p...
|
1049
|
Distributed Algorithms
– Lynch
- 1996
|
|
814
|
The temporal logic of programs
– Pnueli
- 1977
|
|
581
|
Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic
– Clarke, Emerson
- 1981
|
|
453
|
and P.Wolper. An Automata-Theoretic approach to Automatic Program Verification
– Vardi
- 1986
|
|
451
|
The algorithmic analysis of hybrid systems
– Alur, Courcoubetis, et al.
- 1995
|
|
407
|
Symbolic model-checking for real-time systems
– Henzinger, Nicollin, et al.
- 1992
|
|
357
|
Computer-aided verification of coordinating processes: the Automata-theoretic approach
– Kurshan
- 1994
|
|
336
|
UPPAAL in a nutshell
– Larsen, Pettersson, et al.
- 1997
|
|
296
|
The theory of hybrid automata
– Henzinger
- 1996
|
|
227
|
Automatic symbolic verification of embedded systems
– Alur, Henzinger, et al.
- 1996
|
|
209
|
The Tool KRONOS
– Daws, Olivero, et al.
- 1995
|
|
207
|
What’s decidable about hybrid automata
– Henzinger, Kopke, et al.
- 1995
|
|
191
|
An old-fashioned recipe for real time
– Abadi, Lamport
- 1992
|
|
189
|
A really temporal logic
– Alur, Henzinger
- 1989
|
|
179
|
Model-checking in dense real-time
– Alur, Courcoubetis, et al.
- 1993
|
|
163
|
Timing Assumptions and Verification of Finite-State Concurrent Systems
– Dill
- 1989
|
|
138
|
The benefits of relaxing punctuality
– Alur, Feder, et al.
- 1996
|
|
123
|
Specifying real-time properties with metric temporal logic
– Koymans
- 1990
|
|
108
|
Quantitative temporal reasoning
– Emerson, Mok, et al.
- 1990
|
|
95
|
Temporal Logic for Real-Time Systems
– Ostroff
- 1989
|
|
93
|
Computer-Aided Verification
– Clarke, Kurshian
- 1996
|
|
93
|
HyTech: The next generation
– Henzinger, Ho, et al.
- 1996
|
|
82
|
Liveness in timed and untimed systems
– Gawlick, Segala, et al.
- 1993
|
|
79
|
What good are digital clocks
– Henzinger, Manna, et al.
- 1992
|
|
76
|
Time constrained automata
– Merritt, Modugno, et al.
- 1991
|
|
74
|
Minimization of timed transition systems
– Alur, Courcoubetis, et al.
- 1992
|
|
71
|
Modelchecking for probabilistic real-time systems
– Alur, Courcoubetis, et al.
- 1991
|
|
71
|
Formal Verification of Probabilistic Systems
– Alfaro
- 1997
|
|
60
|
Modularity for timed and hybrid systems
– Alur, Henzinger
- 1997
|
|
59
|
Event-clock automata: A determinizable class of timed automata
– Alur, Fix, et al.
- 1999
|
|
53
|
Decidability of bisimulation equivalence for parallel timer processes
– Cerans
- 1992
|
|
52
|
A Kleene theorem for timed automata
– Asarin, Caspi, et al.
- 1997
|
|
51
|
Minimum and maximum delay problems in realtime systems
– Courcoubetis, Yannakakis
- 1991
|
|
44
|
S.: Modeling Urgency in Timed Systems
– Bornot, Sifakis, et al.
- 1997
|
|
41
|
Timing verification by successive approximation
– Alur, Itai, et al.
|
|
41
|
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
– Behrmann, Larsen, et al.
- 1999
|
|
40
|
Some progress in the symbolic verification of timed automata
– Bozga, Maler, et al.
- 1997
|
|
38
|
Timing analysis in COSPAN
– Alur, Kurshan
- 1996
|
|
34
|
The observational power of clocks
– Alur, Courcoubetis, et al.
- 1994
|
|
34
|
An efficient algorithm for minimizing real-time transition systems
– Yannakakis, Lee
- 1993
|
|
33
|
Time-abstracted bisimulation: Implicit specification and decidability
– Larsen, Yi
- 1993
|
|
31
|
Real-time symbolic model checking for discrete time models
– Campos, Clarke
- 1995
|
|
30
|
It's about time: real-time logics reviewed
– Henzinger
- 1998
|
|
27
|
R.: Verifying Abstractions of Timed Systems
– Tasiran, Alur, et al.
- 1996
|
|
25
|
Analysis of timed systems based on time--abstracting bisimulations
– Tripakis, Yovine
- 1996
|
|
22
|
The regular real-time languages
– Henzinger, Raskin, et al.
- 1998
|
|
22
|
Specification and verification of concurrent programs in CESAR
– Queille, Sifakis
- 1982
|
|
17
|
Model-checking of real-time systems: a telecommunications application
– Alur, Jagadeesan, et al.
- 1997
|
|
12
|
State minimization for concurrent system analysis based on state space exploration
– Kang, Lee
- 1994
|
|
11
|
STARI: A Case Study in Compositional and Hierarchical Timing Verification
– Tasiran, Brayton
- 1997
|
|
