Efficient scaling-invariant checking of timed bisimulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 177-188

  Weise, Carsten ^a   Lenzkes, Dirk ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Algorithms and data structures; Automata and formal languages; Decidability; Program specification and verification; Real time systems

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; DISTRIBUTED DATABASE SYSTEMS; FORMAL LANGUAGES; HYBRID SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; ROBOTS;

ALGORITHMS AND DATA STRUCTURES; AUTOMATA AND FORMAL LANGUAGES; DECISION ALGORITHMS; DISTRIBUTED SYSTEMS; INVARIANT CHECKING; PROGRAM SPECIFICATION; TIMED BISIMULATION; TOP DOWN APPROACHES;

REAL TIME SYSTEMS;

EID: 84949680790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023458     Document Type: Conference Paper

References (16)

1. [ACD93] R. Alur, C. Courcoubetis, D. Dill. Modelchecking in dense real-time. Information and Computation, 104(1):2-34, May 1993.
2. [AC+95] R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, et al. The algorithmic analysis of hybrid systems. TCS, February 1995.
3. [ACH94] R. Alur, C. Courcoubetis, T.A. Henzinger. The observational power of clocks. CONCUR 94, LNCS 836, Springer 1994, pp. 162-177.
4. [AD94] R. Alur, D.L. Dill. A Theory of Timed Automata, in: Theoretical Computer Science Vol. 126, No. 2, April 1994, pp. 183-236.
5. [AHV93] R. Alur, T.A. Henzinger, M.Y. Vardi. Parametric real-time reasoning. Proc. 25th STOC, ACM Press 1993, pp. 592-601.
6. [Čer92] K. Čerāns. Decidability of Bisimulation Equivalences for Parallel Timer Processes. in: Proc. CAV '92, LNCS 663, pp. 302-315.
7. [CGL93] K. Čerāns, J.C. Godsken, K.G. Larsen. Timed Modal Specification - Theory and Tools, in: Proc. CAV '93, LNCS 697, pp. 253-267.
8. [DÌ189] D.L. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems, in: LNCS 407, Springer Berlin 1989, pp. 197-212.
9. [HKV96] T.A. Henzinger, O. Kupferman, M.Y. Vardi. A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking, in: Proc. CONCUR 96.
10. [HNSY92] T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine. Symbolic Model Checking for Real-time Systems. LICS '92, pp. 1-13.
11. [LY93] D. Lee, M. Yannakakis. An efficient algorithm or minimizing real-time transition systems. CAV '93, LNCS 697, Springer Berlin 1993, pp. 210-223.
12. [LSW95] K.G. Larsen, B. Steffen, C. Weise. Fischer's Protocol Revisited: A Simple Proof Using Modal Constraints, in: LNCS 1066, Springer 1996.
13. [LV91] N. Lynch, F. Vaandrager. Forward and Backward Simulations for Timing-Based Systems, in: REX Workshop, LNCS 600, pp. 397-446, 1991.
14. [Mil89] R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
15. [NSY93] X. Nicollin, J. Sifakis, S. Yovine. From ATP to Timed Graphs and Hybrid Systems. Acta Informatica 30, 1993, S. 181-202.
16. [WL96] C. Weise, D. Lenzkes. A Fast Decision Algorithm for Timed Refinement. AIB 96-11, Technical Report University of Tech. Aachen, 1996.