We propose a new hybrid automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed automaton model of [33, 42] and the phase transition system models of [36, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) a denition of hybrid automata and of an implementation relation based on hybrid traces, (2) a denition of a simulation between hybrid automata and a proof that existence of a simulation implies the implementation relation, (3) a denition of composition and hiding operations on hybrid automata and a proof that these operations respect the implementation relation, (4) a denition of hybrid I/O automata, which specialize hybrid automata by an additional distinction between input and output, and a proof that the results on simulation relations, composition and hiding carry over to this new setting, and (5) a denition of receptiveness for hybrid I/O automata and a proof that, assuming
|
2807
|
Communication and Concurrency
– Milner
- 1989
|
|
2749
|
Communicating Sequential Processes
– Hoare
- 1985
|
|
1515
|
Model Checking
– Clarke, Grumberg, et al.
- 1999
|
|
1421
|
The theory of timed automata
– Alur, Dill
- 1991
|
|
1371
|
The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1992
|
|
1062
|
Distributed Algorithms
– Lynch
- 1996
|
|
899
|
A calculus of mobile processes
– Milner, Parrow, et al.
- 1992
|
|
752
|
The temporal logic of actions
– Lamport
- 1991
|
|
492
|
Composing Specifications
– Abadi, Lamport
- 1993
|
|
460
|
The algorithmic analysis of hybrid systems
– Alur, Courcoubetis, et al.
- 1995
|
|
419
|
Assigning meanings to programs
– Floyd
- 1967
|
|
390
|
An introduction to input/output automata
– Lynch, Tuttle
- 1989
|
|
370
|
Algebraic Theory of Processes
– Hennessy
- 1988
|
|
338
|
Hierarchical correctness proofs for distributed algorithms
– Lynch, Tuttle
- 1987
|
|
300
|
Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems
– Alur, Courcoubetis, et al.
- 1993
|
|
246
|
Semantics of Programming Languages – Structures and Techniques
– Gunter
- 1992
|
|
237
|
Trace Theory for Automatic Hierarchical Verification of SpeedIndependent Circuits
– Dill
- 2001
|
|
235
|
Reactive modules
– Alur, Henzinger
- 1999
|
|
228
|
Mathematical Control Theory, Deterministic Finite Dimensional Systems, Second Edition
– Sontag
- 1998
|
|
159
|
What good is temporal logic
– Lamport
- 1983
|
|
131
|
From timed to hybrid systems
– Maler, Manna, et al.
- 1991
|
|
98
|
Liveness in timed and untimed systems
– Segala, Gawlick, et al.
- 1998
|
|
95
|
Specifying and using a partitionable group communication service
– Fekete, Lynch, et al.
- 1997
|
|
92
|
The generalized railroad crossing: A case study in formal verification of real-time system
– Heitmeyer, Lynch
- 1994
|
|
84
|
Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge Tracts in Theoretical Computer Science
– Roever, Engelhardt
- 1998
|
|
82
|
Time constrained automata
– Merritt, Modugno, et al.
- 1991
|
|
75
|
Forward and backward simulations for timing-based systems
– Lynch, Vaandrager
- 1991
|
|
72
|
and T A Henzinger. Modularity for timed and hybrid systems
– Alur
- 1997
|
|
68
|
Studies in Hybrid Systems: Modelling, analysis and control
– Branicky
- 1995
|
|
68
|
Verifying hybrid systems
– Manna, Pnueli
- 1993
|
|
57
|
Verification of an audio control protocol
– Bosscher, Polak, et al.
- 1994
|
|
52
|
Development methods for computer programs including a notion of interference
– Jones
- 1981
|
|
50
|
Introduction to Mathematical System Theory: a Behavioral Approach
– Polderman, Willems
- 1997
|
|
43
|
Revisiting the Paxos algorithm
– Prisco
- 1997
|
|
37
|
Action transducers and timed automata
– Vaandrager, Lynch
|
|
32
|
Forward and backward simulations, I: Untimed systems
– Lynch, Vaandrager
- 1995
|
|
31
|
Composing speci
– Abadi, Lamport
- 1993
|
|
20
|
Compositional refinement for hierarchical hybrid systems
– Alur, Grosu, et al.
- 2001
|
|
19
|
Verifying Timing Properties of Concurrent Algorithms
– Luchangco, Soeylemez, et al.
- 1994
|
|
19
|
F.: Forward and backward simulations II.: timing-based systems
– Lynch, Vaandrager
- 1996
|
|
19
|
Formal Verification of Communication Protocols
– Smith
- 1996
|
|
18
|
Verification of automated vehicle protection systems
– Weinberg, Lynch, et al.
- 1995
|
|
17
|
Hybrid I/O automata revisited
– Lynch, Segala, et al.
- 2001
|
|
16
|
High-level modeling and analysis of tcas., in
– Lividas, Lygeros, et al.
- 1999
|
|
15
|
Data Re Model-Oriented Proof Methods and Their Comparison
– Roever, Engelhardt
- 1998
|
|
14
|
Assume-guarantee reasoning for hierarchical hybrid systems
– Henzinger, Minea, et al.
- 2001
|
|
14
|
Proving safety properties of hybrid systems
– Kapur, Henzinger, et al.
- 1994
|
|
14
|
On the formal verification of the TCAS conflict resolution algorithms
– Lygeros, Lynch
- 1997
|
|
14
|
Computer-assisted simulation proofs
– Sogaard-Andersen, Garland, et al.
- 1993
|
|
13
|
Safety verification for automated platoon maneuvers: A case study
– Dolginova, Lynch
- 1997
|
|
