(Enter summary)
Abstract: . 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... (Update)
Cited by: More
A Reasoning Tool for Timed CSP based on Constraint Solving - Jin Song Dong
(Correct)
Modeling Long--Running Transactions with - Communicating Hierarchical Timed
(Correct)
Liveness Checking as Safety Checking for Infinite State Spaces - Schuppan, Biere (2005)
(Correct)
Similar documents (at the sentence level):
28.2%: Automata-theoretic Verification of Real-Time Systems - Alur, Dill (1995)
(Correct)
Active bibliography (related documents): More All
0.2: Model-Checking in Dense Real-time - Alur, Courcoubetis, Dill (1993)
(Correct)
0.2: Real-time Logics: Complexity and Expressiveness - Alur, Henzinger (1990)
(Correct)
0.2: Verification of Fair Transition Systems - Kupferman, Vardi (1996)
(Correct)
Similar documents based on text: More All
0.2: Are Timed Automata Updatable? - Bouyer, Dufourd, Fleury, Petit (2000)
(Correct)
0.1: Timed Tree Automata with an Application to Temporal Logic - Torre, Napoli
(Correct)
0.1: It's About Time: Real-time Logics Reviewed - Henzinger (1998)
(Correct)
Related documents from co-citation: More All
16: The algorithmic analysis of hybrid systems
- Alur, Coucoubetis et al. - 1995
16: A temporal calculus of communicating systems (context) - Moller, Tofts - 1990
15: From ATP to timed graphs and hybrid systems
- Nicollin, Sifakis et al. - 1992
BibTeX entry: (Update)
R. Alur, D.L. Dill. A Theory of Timed Automata. in: Theoretical Computer Science Vol. 126, No. 2, April 1994, pp. 183-236. http://citeseer.ist.psu.edu/alur94theory.html More
@article{ alur94theory,
author = "Rajeev Alur and David L. Dill",
title = "A theory of timed automata",
journal = "Theoretical Computer Science",
volume = "126",
number = "2",
pages = "183--235",
year = "1994",
url = "citeseer.ist.psu.edu/alur94theory.html" }
Citations (may not include all citations):
2732
Communicating sequential processes (context) - Hoare - 1978 ACM DBLP
1911
Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1097
Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
779
Symbolic model checking: 10 20 states and beyond
- Burch, Clarke et al. - 1992
539
The temporal logic of programs (context) - Pnueli - 1977 ACM DBLP
434
An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
374
Automata on infinite objects (context) - Thomas - 1990 ACM DBLP
299
Model-checking for real-time systems (context) - Alur, Courcoubetis et al. - 1990 ACM DBLP
229
Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967 ACM
218
Safety analysis of timing properties in real-time systems (context) - Jahanian, Mok - 1986 ACM DBLP
198
Trace Theory for Automatic Hierarchical Verification of Spee.. (context) - Dill - 1989 ACM
177
Temporal logic can be more expressive (context) - Wolper - 1983 DBLP
172
A really temporal logic
- Alur, Henzinger - 1989 ACM DBLP
160
What good is temporal logic (context) - Lamport - 1983
141
Timing assumptions and verification of finite-state concurre.. (context) - Dill - 1989 ACM DBLP
122
Applications of temporal logic to the specification and veri.. (context) - Pnueli - 1986 ACM DBLP
119
Using branching-time temporal logic to synthesize synchroniz.. (context) - Emerson, Clarke - 1982
118
Temporal Logic of Real-time Systems (context) - Ostroff - 1990
116
From ATP to timed graphs and hybrid systems
- Nicollin, Sifakis et al. - 1991 ACM DBLP
106
A partial approach to model-checking
- Godefroid, Wolper - 1991
92
Quantitative temporal reasoning (context) - Emerson, Mok et al. - 1990 ACM DBLP
88
The benefits of relaxing punctuality
- Alur, Feder et al. - 1991 ACM DBLP
86
Specifying real-time properties with metric temporal logic (context) - Koymans - 1990 ACM DBLP
81
The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
73
Temporal proof methodologies for real-time systems
- Henzinger, Manna et al. - 1991 ACM DBLP
71
Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
69
Using mappings to prove timing properties
- Lynch, Attiya - 1990 ACM DBLP
66
Model-checking for probabilistic real-time systems
- Alur, Courcoubetis et al. - 1991
58
Explicit-clock temporal logic (context) - Harel, Lichtenstein et al. - 1990
53
Testing and generating infinite sequences by a finite automa.. (context) - McNaughton - 1966 DBLP
50
Minimum and maximum delay problems in realtime systems (context) - Courcoubetis, Yannakakis - 1991
42
tapes: a simplified approach (context) - Choueka, automata - 1974
39
Analysis of asynchronous concurrent systems by Petri nets (context) - Ramchandani - 1974
37
Decidability of bisimulation equivalence for parallel timer .. (context) - Cer - 1992
32
A graph-theoretic approach for timing analysis and its imple.. (context) - Jahanian, Mok - 1987 ACM DBLP
31
Proving real-time properties of programs with temporal logic (context) - Bernstein, Harter - 1981 ACM DBLP
26
Finite-state analysis of asynchronous circuits with bounded .. (context) - Lewis - 1989
23
The control of dense real-time discrete event systems (context) - Wong-Toi, Hoffmann - 1991
22
Verifying automata specifications of probabilistic real-time..
- Alur, Courcoubetis et al. - 1991 ACM DBLP
19
A unified approach for showing language containment and equi.. (context) - Clarke, Draghicescu et al. - 1989
18
Verification of concurrent programs -- the automata-theoreti..
- Vardi - 1987
17
Synthesizing processes and schedulers from temporal specific.. (context) - Dill, Wong-Toi - 1990 ACM DBLP
13
Analyzing safety and fault tolerance using timed Petri nets (context) - Leveson, Stolzy - 1985
10
The temporal framework for concurrent programs (context) - Manna, Pnueli - 1981
8
Propositional dynamic logic of regular programs (context) - Harel, Pnueli et al. - 1983 DBLP
7
Complementing deterministic Buchi automata in polynomial tim.. (context) - Kurshan - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~alur/pub.html): More
Parametric Real-time Reasoning - Alur, Henzinger, Vardi (1993)
(Correct)
Modularity for Timed and Hybrid Systems - Alur, Henzinger (1997)
(Correct)
A Really Temporal Logic - Alur, Henzinger (1989)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC