Skip to main content
SpringerLink
Log in

Unifying behavioral equivalences of timed transition systems

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Timed transition systems are one of the most popular real-time models for concurrency. In the paper, various behavioral equivalences of timed transition systems are defined and studied. In particular, categories of this model are constructed, and their properties are studied. In addition, based on the open maps concept, abstract characterization of the considered equivalences is given. Such an approach makes it possible to develop a metatheory designed for unified definition and study of timed behavioral equivalences in the “linear time-branching time” spectrum of semantics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Van Glabbeek, R.J., Handbook of Process Algebras. Chapter “The Linear Time — Branching Time Spectrum I: The Semantics of Concrete, Sequential Processes,” Elsevier, 2001, pp. 3–99.

  2. Hoare, C.A.R., Communicating Sequential Processes, London: Prentice-Hall, 1985.

    MATH  Google Scholar 

  3. Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Sciences, 1980, vol. 92.

  4. Park, D., Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Sciences, 1981, vol. 104, pp. 167–183.

    Article  Google Scholar 

  5. De Nicola, R. and Hennessy, M., Testing Equivalence for Processes, Theor. Comput. Sci., 1984, vol. 34, pp. 83–133.

    Article  MATH  Google Scholar 

  6. Van Glabbeek, R.J. and Goltz, U., Refinement of Actions and Equivalence Notions for Concurrent Systems, Acta Informatica, 2001, vol. 37, pp. 229–327.

    Article  MATH  MathSciNet  Google Scholar 

  7. Rabinovich, A. and Trakhtenbrot, B.A., Behaviour Structures and Nets, Fundamenta Informatica, 1988, vol. 11, no. 4.

  8. Joyal, A., Nielsen, M., and Winskel, G., Bisimulation from Open Maps, Information Computation, 1996, vol. 127, no. 2, pp. 164–185.

    Article  MATH  MathSciNet  Google Scholar 

  9. Nielsen, M. and Cheng, A., Observing Behaviour Categorically, Lecture Notes in Computer Sciences, 1996, vol. 1026, pp. 263–278.

    MathSciNet  Google Scholar 

  10. Cattani, G.L. and Sassone, V., Higher Dimensional Transition Systems, Logic Comput. Sci., 1996, pp. 55–62.

  11. Fahrenberg, U., A Category of Higher-Dimensional Automata, Lecture Notes in Computer Sciences, 1998, vol. 3441, pp. 187–201.

    MathSciNet  Google Scholar 

  12. Alur, R. and Madhusudan, P., Decision Problems for Timed Automata: A Survey, Lecture Notes in Computer Sciences, 2004, vol. 3185, pp. 1–24.

    Google Scholar 

  13. Henzinger, T.A., Manna, Z., and Pnueli, A., Timed Transition Systems, Lecture Notes in Computer Sciences, 1991, vol. 600, pp. 226–251.

    Article  MathSciNet  Google Scholar 

  14. Aceto, L. and Murphi, D., Timing and Causality in Process Algebra, Acta Informatica, 1996, vol. 33, no. 4, pp. 317–350.

    Article  MATH  MathSciNet  Google Scholar 

  15. Schneider, S., Davies, J., Jackson, D.M., Reed, G.M., Reed, J.M., and Roscoe, A.W., Timed CSP: Theory and Practice, Lecture Notes in Computer Sciences, 1991, vol. 600, pp. 640–675.

    Google Scholar 

  16. Merlin, P., A Study of Recoverability of Computing Systems, PhD Thesis, University of California, Irvine, 1974.

    Google Scholar 

  17. Ramchandani, C., Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, PhD Thesis, Massachusetts Institute of Technology, Cambridge, 1974.

    Google Scholar 

  18. Katoen, J.-P., Langerak, R., Latella, D., and Brinksma, E., On Specifying Real-time Systems in a Causality-based Setting, Lecture Notes in Computer Sciences, 1996, vol. 1135, pp. 385–404.

    Google Scholar 

  19. Virbitskaite, I.B. and Gribovskaya, N.S., Open Maps and Observational Equivalences for Timed Partial Order Models, Fundamenta Informaticae, 2004, vol. 60, no. 1–4, pp. 383–399.

    MATH  MathSciNet  Google Scholar 

  20. Alur, R., Courcoubetis, C., and Henzinger, T.A., The Observational Power of Clocks, Lecture Notes in Computer Sciences, 1994, vol. 836, pp. 162–177.

    Article  MathSciNet  Google Scholar 

  21. Čerāns, K., Decidability of Bisimulation Equivalences for Parallel Timer Processes, Lecture Notes in Computer Sciences, 1993, vol. 663, pp. 302–315.

    Google Scholar 

  22. Weise, C. and Lenzkes, D., Efficient Scaling-invariant Checking of Timed Bisimulation, Lecture Notes in Computer Sciences, 1997, vol. 1200, pp. 176–188.

    MathSciNet  Google Scholar 

  23. Aceto, L. and Jeffrey, A., A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours, Theoretical Comput. Sci., 1995, vol. 152, pp. 251–268.

    Article  MATH  MathSciNet  Google Scholar 

  24. Henzinger, T.A., Majumdar, R., and Prabhu, V.S., Quantifying Similarities between Timed Systems, Lecture Notes in Computer Sciences, 2005, vol. 3829, pp. 226–241.

    Article  Google Scholar 

  25. Fokkink, W., Pang, J., and Wijs, A., Is Timed Branching Bisimilarity an Equivalence Indeed? Lecture Notes in Computer Sciences, 2005, vol. 3829, pp. 258–272.

    Article  Google Scholar 

  26. Cleaveland, R. and Zwarico, A.E., A Theory of Testing for Real-time, Logic Comput. Sci., 1991, pp. 110–119.

  27. Steffen, B. and Weise, C., Deciding Testing Equivalence for Real-time Processes with Dense Time, Lecture Notes in Computer Sciences, 1993, vol. 711, pp. 703–713.

    MathSciNet  Google Scholar 

  28. Bihler, E. and Vogler, W., Timed Petri Nets: Efficiency of Asynchronous Systems, Lecture Notes in Computer Sciences, 2004, vol. 3185, pp. 25–58.

    Google Scholar 

  29. Andreeva, M.V., Bozhenkova, E.N., and Virbitskaite, I.B., Analysis of Timed Concurrent Models Based on Testing Equivalence, Fundamenta Informaticae, 2000, vol. 43, nos. 1–4, pp. 1–20.

    MATH  MathSciNet  Google Scholar 

  30. Andreeva, M.V. and Virbitskaite, I.B., Observational Timed Equivalences for Timed Stable Event Structures, Fundamenta Informaticae, 2006, vol. 72, no. 4, pp. 1–19.

    MATH  MathSciNet  Google Scholar 

  31. Hune, T. and Nielsen, M., Bisimulation and Open Maps for Timed Transition Systems, Fundamenta Informaticae, 1999, vol. 38, pp. 61–77.

    MATH  MathSciNet  Google Scholar 

  32. Oshevskaya, E.S., Open Maps Bisimulations for Higher Dimensional Automata Models, Lecture Notes in Computer Sciences, 2009, vol. 5699, pp. 274–286.

    Article  Google Scholar 

  33. Gribovskaya, N.S. and Virbitskaite, I.B., Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems, Fundamenta Informaticae, 2009, vol. 93, pp. 127–142.

    MATH  MathSciNet  Google Scholar 

  34. Alur, R. and Dill, D., The Theory of Timed Automata, Theoretical Comput. Sci., 1994, vol. 126, pp. 183–235.

    Article  MATH  MathSciNet  Google Scholar 

  35. Cleaveland, R. and Hennessy, M., Testing Equivalence as a Bisimulation Equivalence, Lecture Notes in Computer Sciences, 1989, vol. 407, pp. 11–23.

    Google Scholar 

  36. Goltz, U. and Wehrheim, H., Causal Testing, Lecture Notes in Computer Sciences, 1996, vol. 1113, pp. 394–406.

    MathSciNet  Google Scholar 

  37. Chatain, T. and Jard, C., Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets, Lecture Notes in Computer Sciences, 2005, vol. 3829, pp. 196–210.

    Article  Google Scholar 

  38. Bouyer, P., Haddad, S., and Reynier, P.-A., Timed Unfoldings for Networks of Timed Automata, Lecture Notes in Computer Sciences, 2006, vol. 4218, pp. 292–306.

    Article  Google Scholar 

  39. Aura, T. and Lilius, J., Time Processes for Time Petri Nets, Lecture Notes in Computer Sciences, 1997, vol. 1248, pp. 136–155.

    MathSciNet  Google Scholar 

  40. Tsalenko, M.Sh. and Shul’geifer, E.G., Lectures on Category Theory, Moscow: Nauka, 1974.

    Google Scholar 

  41. Joyal, A. and Moerdijk, I., A Completeness Theorem for Open Maps, Ann. Pure Applied Logic, 1994, vol. 70, pp. 51–86.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A. P. Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences, pr. Akademika Lavrent’eva 6, Novosibirsk, 630090, Russia

    I. B. Virbitskaite & N. S. Gribovskaya

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    I. B. Virbitskaite & N. S. Gribovskaya

Authors
  1. I. B. Virbitskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. S. Gribovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. B. Virbitskaite.

Additional information

Original Russian Text © I.B. Virbitskaite, N.S. Gribovskaya, 2010, published in Programmirovanie, 2010, Vol. 36, No. 3

Rights and permissions

Reprints and permissions

About this article

Cite this article

Virbitskaite, I.B., Gribovskaya, N.S. Unifying behavioral equivalences of timed transition systems. Program Comput Soft 36, 138–148 (2010). https://doi.org/10.1134/S0361768810030023

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768810030023

Keywords

Search

Navigation