Skip to main content
SpringerLink
Log in

Timed Equivalences for Timed Event Structures

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

Abstract

The intention of the paper is to develop a framework for observational equivalences in the setting of a real-time partial order model. In particular, we introduce a family of equivalences of linear time – branching time spectrum based on interleaving, causal trees and partial order semantics, in the setting of event structures with dense time domain. We study the relationships between these approaches and show their discriminating power. Furthermore, when dealing with particular subclasses of the model under consideration there is no difference between a more concrete or a more abstract approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L.: History Preserving, Causal and Mixed-ordering Equivalence over Stable Event Structures. Fundamenta Informaticae 17(4), 319–331 (1992)

    MATH  MathSciNet  Google Scholar 

  2. Aceto, L., De Nicola, R., Fantechi, A.: Testing Equivalences for Event Structures. In: Venturini Zilli, M. (ed.) Mathematical Models for the Semantics of Parallelism. LNCS, vol. 280, pp. 1–20. Springer, Heidelberg (1987)

    Google Scholar 

  3. Alur, R., Dill, D.: The Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Alur, R., Henzinger, T.A.: Logics and Models of Real Time: a Survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 74–106. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  5. Andreeva, M.V., Bozhenkova, E.N., Virbitskaite, I.B.: Analysis of Timed Concurrent Models Based on Testing Equivalence. Fundamenta Informaticae 43(1-4), 1–20 (2000)

    MATH  MathSciNet  Google Scholar 

  6. Andreeva, M.A., Virbitskaite, I.B.: Timed Equivalences for Timed Event Structures. Available from, http://www.iis.nsk.su/persons/virb/virb.zip

  7. Baier, C., Katoen, J.-P., Latella, D.: Metric Semantics for True Concurrent Real Time. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 568–579. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Čerāns, K.: Decidability of Bisimulation Equivalences for Parallel Timer Processes. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 302–315. Springer, Heidelberg (1993)

    Google Scholar 

  9. Darondeau, P., Degano, P.: Causal Trees: Interleaving + Causality. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 239–255. Springer, Heidelberg (1990)

    Google Scholar 

  10. De Nicola, R., Hennessy, M.: Testing Equivalence for Processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  11. van Glabbeek, R.J.: The Linear Time – Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves. Extended Abstract. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)

    Google Scholar 

  12. van Glabbeek, R.J., Goltz, U.: Equivalence Notions for Concurrent Systems and Refinement of Actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 237–248. Springer, Heidelberg (1989)

    Google Scholar 

  13. Goltz, U., Wehrheim, H.: Causal Testing. In: Penczek, W., Szałas, A. (eds.) MFCS 1996. LNCS, vol. 1113, pp. 394–406. Springer, Heidelberg (1996)

    Google Scholar 

  14. Hennessy, M., Milner, R.: Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM 32, 137–162 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, London (1985)

    MATH  Google Scholar 

  16. Maggiolo-Schettini, A., Winkowski, J.: Towards an Algebra for Timed Behaviours. Theoretical Computer Science 103, 335–363 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Milner, R.: Communication and Concurrency. Prentice-Hall, London (1989)

    MATH  Google Scholar 

  18. Murphy, D.: Time and Duration in Noninterleaving Concurrency. Fundamenta Informaticae 19, 403–416 (1993)

    MATH  MathSciNet  Google Scholar 

  19. Steffen, B., Weise, C.: Deciding Testing Equivalence for Real-Time Processes with Dense Time. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 703–713. Springer, Heidelberg (1993)

    Google Scholar 

  20. Virbitskaite, I.B.: An Observation Semantics for Timed Event Structures. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 215–225. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Virbitskaite, I.B., Gribovskaya, N.S.: Open Maps and Observational Equivalences for Timed Partial Order Models. Fundamenta Informaticae 60(1-4), 383–399 (2004)

    MATH  MathSciNet  Google Scholar 

  22. Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 364–397. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  23. Weise, C., Lenzkes, D.: Efficient Scaling-Invariant Checking of Timed Bisimulation. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 176–188. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia

    M. V. Andreeva & I. B. Virbitskaite

Authors
  1. M. V. Andreeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. B. Virbitskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Novosibirsk State Technical University,  

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andreeva, M.V., Virbitskaite, I.B. (2005). Timed Equivalences for Timed Event Structures. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_2

Download citation

  • DOI: https://doi.org/10.1007/11535294_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation