Abstract
Open maps have been used for defining bisimulations for a range of models, but none of these have modelled real-time. We define a category of timed transition systems, and use the general framework of open maps to obtain a notion of bisimulation. We show this to be equivalent to the standard notion of timed bisimulation. Thus the abstract results from the theory of open maps apply, e.g. the existence of canonical models and characteristic logics. Here, we provide an alternative proof of decidability of bisimulation for finite timed transition systems in terms of open maps, and illustrate the use of open maps in presenting bisimulations.
Preview
Unable to display preview. Download preview PDF.
References
E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. Proc. of LICS'97, 1997.
R. Alur and D.L. Dill. Automata for modelling real-time systems. Proc. of ICALP'90, LNCS 433:pages 322–335, 1990.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126, 1994.
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.
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.
K. čerāns. Decidability of bisimulation equivalence for parallel timer processes. Proc. of CAV'92, LNCS 663, 1992.
A. Cheng and M. Nielsen. Open maps (at) work. Proc. of FST&TCS '95, LNCS 1026, 1996.
T. Hune and M. Nielsen. Timed bisimulation and open maps. Technical Report RS-98-4, BRICS, 1998.
A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127,2:pages 164–185, 1996.
K.J. Kristoffersen and J. Niedermann. User's manual for Epsilon. Available via anonymous ftp at cs.auc.dk, December 1994.
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.
R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science, 1989.
X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Acta Informatica, 30:pages 181–202, 1993.
Y. Wang. Real-time behaviour of asynchronous agents. Proc. of CONCUR'90, LNCS 458, 1990.
C. Weise and D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Proc. of STACS'97, LNCS 1200:pages 177–188, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hune, T., Nielsen, M. (1998). Timed bisimulation and open maps. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055787
Download citation
DOI: https://doi.org/10.1007/BFb0055787
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive