Timed bisimulation and open maps

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

Volumn 1450 LNCS, Issue , 1998, Pages 378-387

  Hune, Thomas ^a   Nielsen, Mogens ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

BISIMULATIONS; CANONICAL MODELS; OPEN MAPS; REAL TIME; TIMED BISIMULATION; TIMED TRANSITION SYSTEMS;

ARTIFICIAL INTELLIGENCE; FAULT TOLERANCE;

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

References (15)

1. E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. Proc. of LICS'97, 1997.
2. R. Alur and D.L. Dill. Automata for modelling real-time systems. Proc. of ICALP'90, LNCS 433:pages 322-335, 1990.
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126, 1994.
4. R. Alur and T.A. Henzinger. Logics and models for real time: A survey. Real-Time: Theory in Practice, LNCS 600:pages 74-106, 1991.
5. J.H. Andersen, K.J. Kristoffersen, K.G. Larsen, and J. Niedermann. Automatic synthesis of real time systems. Proc. of ICALP'95, LNCS 944:pages 535-546, 1995.
6. K. Čerāns. Decidability of bisimulation equivalence for parallel timer processes. Proc. of CAV'92, LNCS 663, 1992.
7. A. Cheng and M. Nielsen. Open maps (at) work. Proc. of FST&TCS '95, LNCS 1026, 1996.
8. T. Hune and M. Nielsen. Timed bisimulation and open maps. Technical Report RS-98-4, BRICS, 1998.
9. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127, 2:pages 164-185, 1996.
10. K.J. Kristoffersen and J. Niedermann. User's manual for Epsilon. Available via anonymous ftp at cs.auc.dk, December 1994.
11. F. Laroussinie, K. G. Larsen, and C. Weise. From timed automata to logic - and back. Proc. of MFCS'95, LNCS 969:pages 529-539, 1995.
12. R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science, 1989.
13. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Acta Informatica, 30:pages 181-202, 1993.
14. Y. Wang. Real-time behaviour of asynchronous agents. Proc. of CON-CUR'90, LNCS 458, 1990.
15. C. Weise and D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Proc. of STACS'97, LNCS 1200:pages 177-188, 1997.