Forward and Backward Simulations, II: Timing-Based Systems

A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinements, (2) forward and backward simulations, (3) hybrid forward?backward and backward?forward simulations, and (4) history and prophecy relations. Relationships between the different types of simulations, as well as soundness and completeness results, are stated and proved. These results are (with one exception) analogous to the results for untimed systems in Part I of this paper. In fact, many of the results for the timed case are obtained as consequences of the analogous results for the untimed case.

[1]  Thomas A. Henzinger,et al.  Timed Transition Systems , 1991, REX Workshop.

[2]  M. Dal Cin,et al.  The Algebraic Theory of Automata , 1980 .

[3]  Insup Lee,et al.  The formal treatment of priorities in real-time computation , 1989 .

[4]  Eugene W. Stark.  Proving Entailment Between Conceptual State Specifications , 1988, Theor. Comput. Sci..

[5]  Nancy A. Lynch,et al.  Forward and Backward Simulations: I. Untimed Systems , 1995, Inf. Comput..

[6]  Victor Luchangco,et al.  Using simulation techniques to prove timing properties , 1995 .

[7]  Nancy A. Lynch,et al.  The generalized railroad crossing: a case study in formal verification of real-time systems , 1994, 1994 Proceedings Real-Time Systems Symposium.

[8]  Michael Merritt,et al.  Completeness Theorems for Automata , 1990, REX Workshop.

[9]  Thomas A. Henzinger,et al.  Sooner is Safer Than Later , 1992, Inf. Process. Lett..

[10]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[11]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[12]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[13]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[14]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1991, TOPL.

[15]  A. Prasad Sistla,et al.  Proving Correctness with Respect to Nondeterministic Safety Specifications , 1991, Information Processing Letters.

[16]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[17]  Jim Davies,et al.  A Brief History of Timed CSP , 1995, Theor. Comput. Sci..

[18]  R. J. vanGlabbeek.  Comparative concurrency semantics and refinement of actions , 1996 .

[19]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[20]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[21]  Stephen J. Garland,et al.  Larch: Languages and Tools for Formal Specification , 1993, Texts and Monographs in Computer Science.

[22]  Joseph Sifakis,et al.  An Approach to the Description and Analysis of Hybrid Systems , 1992, Hybrid Systems.

[23]  F. Vaandrager,et al.  A Comparison of Additivity Axioms in Timed Transition Systems. , 1993 .

[24]  Shay Kutten,et al.  Time Optimal Self-Stabilizing Spanning Tree Algorithms , 1993, FSTTCS.

[25]  Joseph Sifakis,et al.  From ATP to Timed Graphs and Hybrid Systems , 1991, REX Workshop.

[26]  Amir Pnueli,et al.  Development of Hybrid Systems , 1994, FTRTFT.

[27]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[28]  Nancy A. Lynch,et al.  Simulation Techniques for Proving Properties of Real-Time Systems , 1993, REX School/Symposium.

[29]  Thomas A. Henzinger,et al.  Automatic Symbolic Verification of Embedded Systems , 1996, IEEE Trans. Software Eng..

[30]  R. Alur.  Techniques for automatic verification of real-time systems , 1991 .

[31]  Amy E. Zwarico.  Timed acceptances: an algebra of time-dependent computing , 1988 .

[32]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

[33]  Nancy A. Lynch.  Multivalued Possibilities Mappings , 1989, REX Workshop.

[34]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[35]  N. Lynch,et al.  Forward and backward simulations , 1993 .

[36]  Nancy A. Lynch,et al.  Using mappings to prove timing properties , 1990, PODC '90.

[37]  Nancy A. Lynch,et al.  Liveness in Timed and Untimed Systems , 1998, Inf. Comput..

[38]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[39]  Joseph Sifakis,et al.  ATP: an Algebra for Timed Processes , 1990, Programming Concepts and Methods.

[40]  Gérard Berry,et al.  The ESTEREL Synchronous Programming Language and its Mathematical Semantics , 1984, Seminar on Concurrency.

[41]  Ekrem Sezer Söylemez.  Automatic verification of the timing properties of MMT automata , 1994 .

[42]  Nancy A. Lynch,et al.  Proving time bounds for randomized distributed algorithms , 1994, PODC '94.

[43]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[44]  A. Steven Klusener,et al.  The Silent Step in Time , 1992, CONCUR.

[45]  Nancy A. Lynch,et al.  Verifying timing properties of concurrent algorithms , 1994, FORTE.

[46]  Zohar Manna,et al.  Verifying Hybrid Systems , 1992, Hybrid Systems.

[47]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[48]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[49]  Jan Friso Groote,et al.  Specification and verification of real time systems in ACP , 1990, PSTV.

[50]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[51]  Willem Griffioen.  Proof-checking an audio control protocol with LP , 1995 .

[52]  Nancy A. Lynch,et al.  Correctness of At-Most-Once Message Delivery Protocols , 1993, FORTE.

[53]  J. S gaard-Andersen,et al.  Correctness of Communications Protocols, A case Study , 1993 .

[54]  Fred B. Schneider,et al.  Proving Nondeterministically Specified Safety Properties Using Progress Measures , 1993, Inf. Comput..

[55]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[56]  Michael Merritt,et al.  Time-Constrained Automata (Extended Abstract) , 1991, CONCUR.

[57]  Alan Jeffrey,et al.  A Linear Time Process Algebra , 1991, CAV.

[58]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[59]  Nancy A. Lynch,et al.  Action Transducers and Timed Automata , 1992, CONCUR.

[60]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.