Timed bisimulation and open maps

  • Thomas Hune
  • Mogens Nielsen
Contributed Papers Concurrency - Semantics - Logic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1450)


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.

Unable to display preview. Download preview PDF.


  1. [ACM97]
    E. Asarin, P. Caspi, and O. Maler. A Kleene theorem for timed automata. Proc. of LICS'97, 1997.Google Scholar
  2. [AD90]
    R. Alur and D.L. Dill. Automata for modelling real-time systems. Proc. of ICALP'90, LNCS 433:pages 322–335, 1990.MathSciNetGoogle Scholar
  3. [AD94]
    R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126, 1994.Google Scholar
  4. [AH91]
    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.MathSciNetGoogle Scholar
  5. [AKLN95]
    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.MathSciNetGoogle Scholar
  6. [čer92]
    K. čerāns. Decidability of bisimulation equivalence for parallel timer processes. Proc. of CAV'92, LNCS 663, 1992.Google Scholar
  7. [CN96]
    A. Cheng and M. Nielsen. Open maps (at) work. Proc. of FST&TCS '95, LNCS 1026, 1996.Google Scholar
  8. [HN98]
    T. Hune and M. Nielsen. Timed bisimulation and open maps. Technical Report RS-98-4, BRICS, 1998.Google Scholar
  9. [JNW96]
    A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Information and Computation, 127,2:pages 164–185, 1996.MATHMathSciNetCrossRefGoogle Scholar
  10. [KN94]
    K.J. Kristoffersen and J. Niedermann. User's manual for Epsilon. Available via anonymous ftp at, December 1994.Google Scholar
  11. [LLW95]
    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.MathSciNetGoogle Scholar
  12. [Mil89]
    R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science, 1989.Google Scholar
  13. [NSY93]
    X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. Acta Informatica, 30:pages 181–202, 1993.MATHMathSciNetCrossRefGoogle Scholar
  14. [Wan90]
    Y. Wang. Real-time behaviour of asynchronous agents. Proc. of CONCUR'90, LNCS 458, 1990.Google Scholar
  15. [WL97]
    C. Weise and D. Lenzkes. Efficient scaling-invariant checking of timed bisimulation. Proc. of STACS'97, LNCS 1200:pages 177–188, 1997.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Thomas Hune
    • 1
  • Mogens Nielsen
    • 1
  1. 1.Basic Research in Computer Sciencs, Centre of the Danish National Research Foundation, Department of Computer ScienceUniversity of AarhusDenmark

Personalised recommendations