Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems

Formal Modeling and Analysis of Timed Systems

FTRTFT 2004, FORMATS 2004: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems pp 231–245Cite as

The Influence of Durational Actions on Time Equivalences

  • Conference paper

  • 1143 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3253))

Abstract

The hierarchy of untimed equivalences is well understood for action-based systems. This is not the case for timed systems, where it is, for example, possible to detect concurrency by single timed action execution. To clarify the connection between equivalences in timed systems, a timed version of configuration structures is introduced together with timed equivalence notions adapted from untimed equivalences. There actions (events) have an occurrence time and a duration. The result of this paper is that all timed versions of the equivalences from [15] have the same relative discriminating power as in the untimed case, except that interleaving and step (for trace and bisimulation) equivalences coincide if systems are considered where every action must have a positive duration.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L., Murphy, D.: On the ill-timed but well-caused. In: Best [6], pp. 97–111

    Google Scholar 

  2. Aceto, L., Murphy, D.: Timing and causality in process algebra. Acta Informatica 33, 317–350 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bednarczyk, M.A.: Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Institute of Computer Science, Polish Academy of Science (1991)

    Google Scholar 

  4. Bergstra, J.A., Fokkink, W., Ponse, A.: Process algebra with recursive operations. In: Bergstra et al. [5], pp. 333–389

    Google Scholar 

  5. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. North-Holland, Amsterdam (2001)

    MATH  Google Scholar 

  6. Best, E. (ed.): CONCUR 1993. LNCS, vol. 715. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  7. Boudol, G., Castellani, I.: On the semantics of concurrency: Partial orders and transition systems. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol. 249, pp. 123–137. Springer, Heidelberg (1987)

    Google Scholar 

  8. Chen, X.J., Corradini, F.: On the specification and verification of performance properties for a timed process algebra. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 123–137. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Corradini, F.: Absolute versus relative time in process algebras. Information and Computation 156, 122–172 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Degano, P., Nicola, R.D., Montanari, U.: Observational equivalences for concurrency models. In: Wirsing, M. (ed.) Formal Description of Programming Concepts – III, Proceedings of the 3th IFIP WG 2.2 working conference, Ebberup 1986, pp. 105–129. North-Holland, Amsterdam (1987)

    Google Scholar 

  11. Fecher, H.: A completed hierarchy of true concurrent equivalences. Information Processing Letters 89(5), 261–265 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. R.: v. Glabbeek. The linear time–branching time spectrum II: The semantics of sequential systems with silent moves (extended abstract). In: Best [6], pp. 66–81

    Google Scholar 

  13. R.: v. Glabbeek. The linear time–branching time spectrum I. The semantics of concrete, sequential processes. In: Bergstra et al. [5], pp. 3–99

    Google Scholar 

  14. Glabbeek, R.v., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 267–300. Springer, Heidelberg (1990)

    Google Scholar 

  15. Glabbeek, R.v., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, 229–327 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Glabbeek, R.v., Plotkin, G.D.: Configuration structures. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, pp. 199–209. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  17. Glabbeek, R.v., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 224–242. Springer, Heidelberg (1987)

    Google Scholar 

  18. Gorrieri, R., Rensink, A.: Action refinement. In: Bergstra et al. [5], pp. 1047– 1147

    Google Scholar 

  19. Gorrieri, R., Roccetti, M., Stancampiano, E.: A theory of processes with durational actions. Theoretical Computer Science 140, 73–94 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  20. Hoare, C.A.R.: Communications Sequential Processes. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)

    Google Scholar 

  21. Katoen, J.-P., Langerak, R., Latella, D., Brinksma, E.: On specifying real-time systems in a causality-based setting. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 385–404. Springer, Heidelberg (1996)

    Google Scholar 

  22. Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science 25, 267–310 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  23. Murphy, D.: Time and duration in noninterleaving concurrency. Fundamenta Informaticae 19, 403–416 (1993)

    MATH  MathSciNet  Google Scholar 

  24. Pomello, L.: Some Equivalence Notions for Concurrent Systems. An Overview. In: Rozenberg, G. (ed.) APN 1985. LNCS, vol. 222, pp. 381–400. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  25. Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fundamenta Informaticae 11(4), 357–404 (1988)

    MATH  MathSciNet  Google Scholar 

  26. Virbitskaite, I.B.: Observational semantics for timed event structures. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 214–224. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Wang, Y.: CCS+time = an interleaving model for real time systems. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 217–228. Springer, Heidelberg (1991)

    Google Scholar 

  28. 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 

Download references

Author information

Authors and Affiliations

  1. Christian-Albrechts-University, Kiel, Germany

    Harald Fecher

Authors
  1. Harald Fecher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. VERIMAG - University Joseph Fourier - CNRS - INPG, 2, av. de Vignates, 38610, Gières, France

    Yassine Lakhnech

  2. VERIMAG, Centre Equation, 2 av. de Vignate, 38610, Gieres, France

    Sergio Yovine

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fecher, H. (2004). The Influence of Durational Actions on Time Equivalences. In: Lakhnech, Y., Yovine, S. (eds) Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems. FTRTFT FORMATS 2004 2004. Lecture Notes in Computer Science, vol 3253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30206-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30206-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23167-7

  • Online ISBN: 978-3-540-30206-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation