Timed bisimulation and open maps
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.
Unable to display preview. Download preview PDF.
- [ACM97]E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. Proc. of LICS'97, 1997.Google Scholar
- [AD94]R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126, 1994.Google Scholar
- [čer92]K. čerāns. Decidability of bisimulation equivalence for parallel timer processes. Proc. of CAV'92, LNCS 663, 1992.Google Scholar
- [CN96]A. Cheng and M. Nielsen. Open maps (at) work. Proc. of FST&TCS '95, LNCS 1026, 1996.Google Scholar
- [HN98]T. Hune and M. Nielsen. Timed bisimulation and open maps. Technical Report RS-98-4, BRICS, 1998.Google Scholar
- [KN94]K.J. Kristoffersen and J. Niedermann. User's manual for Epsilon. Available via anonymous ftp at cs.auc.dk, December 1994.Google Scholar
- [Mil89]R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science, 1989.Google Scholar
- [Wan90]Y. Wang. Real-time behaviour of asynchronous agents. Proc. of CONCUR'90, LNCS 458, 1990.Google Scholar