Skip to main content
Log in

Analysis of equivalence relations of event structures with continuous time

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

Abstract

Notions of testing and bisimulation equivalencies for concurrent nondeterministic processes in real (continuous) time are introduced and analyzed. Processes are represented by timed event structures. Conditions under which the equivalencies defined coincide are established, and algorithms for deciding equivalence are presented.

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

Access this article

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. Aceto, L., De Nicola, R., and Fantechi, A., Testing Equivalences for Event Structures,Lect. Notes Comput. Sci., 1987, vol. 280, pp. 1–20.

    Google Scholar 

  2. Alur, R., Courcoubetis, C., and Dill, D., Model Checking in Dense Real Time,Inf. Comput, 1993, vol. 104, pp. 2–34.

    Article  MATH  MathSciNet  Google Scholar 

  3. Alur, R., Courcoubetis, C., and Henziger, T.A., The Observational Power of Clocks,Lect. Notes Comput. Sci., 1994, vol. 836, pp. 162–177.

    Google Scholar 

  4. Boudol, G. and Castellani, I., Concurrency and Atomicity,Theor. Comput. Sci., 1989, vol. 59, pp. 25–84.

    Article  MathSciNet  Google Scholar 

  5. Čeráns, K., Decidability of Bisimulation Equivalences for Parallel Timer Processes,Lect. Notes Comput. Sci., 1993, vol. 663, pp. 302–315.

    Google Scholar 

  6. Cleaveland, R. and Hennesy, M., Testing Equivalence as a Bisimulation Equivalence,Lect. Notes Comput. Sci., 1989, vol. 407, pp. 11–23.

    Google Scholar 

  7. Cleaveland, R. and Zwarico, A.E., A Theory of Testing for Real Time,Proc. 6th IEEE Logic, Inf. Comput. Sci. Conf., 1991, pp. 110–119.

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

    Article  MATH  Google Scholar 

  9. Van Clabbeek, R.J., The Linear Time—Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves. Extended Abstract,Lect. Notes Comput. Sci., 1993, vol. 715, pp. 66–81.

    Google Scholar 

  10. Goltz, U. and Wehrheim, H., Causal Testing,Lect. Notes Comput. Sci., 1996, vol. 1113, pp. 394–406.

    MathSciNet  Google Scholar 

  11. Hennesy, M. and Milner, R., Algebraic Laws of Nondeterminism and Concurrency,J. ACM, 1985, vol. 32, pp. 137–162.

    Article  Google Scholar 

  12. Janssen, W., Poel, M., Wu, Q., and Zwiers, J., Layering of Real-Time Distributed Processes,Lect. Notes Comput. Sci., 1994, vol. 863, pp. 393–417.

    Article  Google Scholar 

  13. Katoen, J.-P., Langerak, R., Latella, D., and Brinksma, E., On Specifying Real-Time Systems in a Causality-Based Setting,Lect. Notes Comput. Sci., 1996, vol. 1135, pp. 385–404.

    Google Scholar 

  14. Murphy, D., Time and Duration in Noninterleaving Concurrency,Fundam. Inf., 1993, vol. 19, pp. 403–416.

    MATH  MathSciNet  Google Scholar 

  15. Park, D., Concurrency and Automata on Infinite Sequences,Lect. Notes Comput. Sci., 1981, vol. 154, pp. 561–572.

    Google Scholar 

  16. Steffen, B. and Weise, C., Deciding Testing Equivalence for Real-time Processes with Dense Time.Lect. Notes Comput. Sci., 1993, vol. 711, pp. 703–713.

    MathSciNet  Google Scholar 

  17. Weise, C. and Lenzkes, D., Efficient Scaling-Invariant Checking of Timed Bisimulation,Lect. Notes Comput. Sci., 1997, vol. 1200, pp. 176–188.

    MathSciNet  Google Scholar 

  18. Winskel, G., An Introduction to Event StructuresLect. Notes Comput. Sci., 1989, vol. 354, pp. 364–397.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. N. Bozhenkova.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bozhenkova, E.N., Virbitskaite, I.B. Analysis of equivalence relations of event structures with continuous time. Program Comput Soft 26, 249–257 (2000). https://doi.org/10.1007/BF02759318

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02759318

Keywords

Navigation