Bisimulation and open maps for timed transition systems

Fundamenta Informaticae

Volumn 38, Issue 1-2, 1999, Pages 61-77

  Nielsen, Mogens ^a   Hune, Thomas ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040907658     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-381206     Document Type: Article

References (22)

1. E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. Proc. of LICS'97, pages pages 160-171, 1997.
2. R. Alur and D.L. Dill. Automata for modeling real-time systems. Proc. of ICALP'90, Springer LNCS 433:pages 322-335, 1990.
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:pages 183-235, 1994.
4. R. Alur and T.A. Henzinger. Logics and models for real time: A survey. Real-Time:Theory in Practice, Springer 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, Springer LNCS 944:pages 535-546, 1995.
6. H. R. Andersen and M. Mendler. An asynchronous process algebra with multiple clocks. In Proceedings of ESOP'94, volume Springer LNCS 788, pages pages 58-73. 1994.
7. [Čer92] K. Čerāns. Decidability of bisimulation equivalence for parallel timer processes. Proc. of CAV'92, Springer LNCS 663:pages 302-315, 1992.
8. G.L. Cattani, M. Fiore, and G. Winskel. A theory of recursive domains with applications to concurrency. In Proceedings of LICS'98, pages pages 214-225, 1998.
9. A. Cheng and M. Nielsen. Open maps (at) work. Proc. of FST&TCS '95, Springer LNCS 1026:pages 263-278, 1996.
10. T. Hune and M. Nielsen. Timed bisimulation and open maps. Technical Report RS-98-4, BRIGS, University of Aarhus, 1998.
11. T. Hune and M. Nielsen. Timed bisimulation and open maps. Proc. of MFCS'98, Springer LNCS 1450:pages 378-387, 1998.
12. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127,2:pages 164-185, 1996.
13. K.J. Kristoffersen and J. Niedermann. User's manual for Epsilon. Available via anonymous ftp at cs.auc.dk, 1994.
14. F. Laroussinie, K. G. Larsen, and C. Weise. From timed automata to logic - and back. Proc. of MFCS'95, Springer LNCS 969:pages 529-539, 1995.
15. K. G. Larsen, P. Pettersson, and W. Yi. Model-checking for real-time systems. In Proceedings of the 10th International Conference on Fundamentals of Computation Theory, Springer LNCS 965:pages 62-88, 1995.
16. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. In Springer International Journal of Software Tools for Technology Transfer, 1(1+2):134-152, 1997.
17. +95] M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with generalized stochastic petri nets. Wiley series in parallel computing. John Wiley & Sons, 1995.
18. R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science, 1989.
19. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Acta Informatica, 30:pages 181-202, 1993.
20. Y. Wang. Real-time behaviour of asynchronous agents. Proc. of CONCUR'90, Springer LNCS 458:pages 502-520, 1990.
21. C. Weise, and D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Proc of STACS'97, Springer LNCS 1200:pages 177-188, 1997.
22. G. Winskel and M. Nielsen. Presheaves as transition systems. In Partial order methods in verification, number 29 in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages pages: 129-140. 1996.