Skip to main content
SpringerLink
Log in
Book cover

Processes, Terms and Cycles: Steps on the Road to Infinity pp 251–279Cite as

Timing the Untimed: Terminating Successfully While Being Conservative

  • Chapter

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

Abstract

There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-)extensions of ACP with successful termination. Here, we point out some design decisions which were the possible causes of this misfortune and by taking different decisions, we propose a spectrum of timed process algebras ordered by equational conservativity ordering.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Baeten, J.C.M.: Embedding untimed into timed process algebra: the case for explicit termination. Mathematical Structures in Computer Science (MSCS) 13(4), 589–618 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baeten, J.C.M., Bergstra, J.A.: Real Time Process Algebra. Formal Aspects of Computing 3, 142–188 (1991)

    Article  Google Scholar 

  3. Baeten, J.C.M., Bergstra, J.A.: Discrete time process algebra. Formal Aspects of Computing 8(2), 188–208 (1996)

    Article  MATH  Google Scholar 

  4. Baeten, J.C.M., van Glabbeek, R.J.: Merge and termination in process algebra. In: Nori, K.V. (ed.) FSTTCS 1987. LNCS, vol. 287, pp. 153–172. Springer, Heidelberg (1987)

    Google Scholar 

  5. Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. In: EATCS Monographs. Springer, Berlin (2002)

    Google Scholar 

  6. Baeten, J.C.M., Reniers, M.A.: Timed process algebra (with a focus on explicit termination and relative-timing). In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 59–97. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18. CambrIdge University Press, Cambridge (1990)

    Book  Google Scholar 

  8. Bergstra, J.A., Klop, J.W.: Fixed point semantics in process algebra. Technical Report IW 206/82, Mathematical Center, Amsterdam, The Netherlands (1982)

    Google Scholar 

  9. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1-3), 109–137 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  10. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Proceedings of the CWI Symposium Mathematics and Computer Science, pp. 89–138. North-Holland, Amsterdam (1986)

    Google Scholar 

  11. Bol, R., Groote, J.F.: The meaning of negative premises in transition system specifications. Journal of the ACM (JACM) 43(5), 863–914 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fokkink, W.J., Verhoef, C.: A conservative look at operational semantics with variable binding. Information and Computation (I&C) 146(1), 24–54 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. Journal of Logic and Algebraic Programming (JLAP) 60–61, 229–258 (2004)

    Article  Google Scholar 

  14. Groote, J.F.: Transition system specifications with negative premises. Theoretical Computer Science (TCS) 118(2), 263–299 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation 117(2), 221–239 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Koymans, C.P.J., Vrancken, J.L.M.: Extending process algebra with the empty process. Technical Report 1, Logic Group Preprint Series, Department of Philosophy, Utrecht University, Utrecht, The Netherlands, Extended and enhanced version appeared as [22] (1985)

    Google Scholar 

  17. Moller, F., Tofts, C.M.N.: A temporal calculus of communicating systems. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 401–415. Springer, Heidelberg (1990)

    Google Scholar 

  18. Mousavi, M., Reniers, M.A.: Orthogonal extensions in structural operational semantics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1214–1225. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Nicollin, X., Sifakis, J.: The algebra of timed processes ATP: theory and application. Information and Computation (I&C) 114(1), 131–178 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Vereijken, J.J.: Discrete Time Process Algebra. PhD thesis, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1997)

    Google Scholar 

  21. Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing 2(2), 274–302 (1995)

    MATH  MathSciNet  Google Scholar 

  22. Vrancken, J.L.M.: The algebra of communicating processes with empty process. Theoretical Computer Science 177(2), 287–328 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Eindhoven University of Technology (TU/e), NL-5600 MB, Eindhoven, The Netherlands

    J. C. M. Baeten, M. R. Mousavi & M. A. Reniers

Authors
  1. J. C. M. Baeten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. R. Mousavi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. A. Reniers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp

  2. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Vincent van Oostrom

  3. Department of Theoretical Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Femke van Raamsdonk

  4. VU Vrije Universiteit Amsterdam,  

    Roel de Vrijer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Baeten, J.C.M., Mousavi, M.R., Reniers, M.A. (2005). Timing the Untimed: Terminating Successfully While Being Conservative. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds) Processes, Terms and Cycles: Steps on the Road to Infinity. Lecture Notes in Computer Science, vol 3838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601548_15

Download citation

  • DOI: https://doi.org/10.1007/11601548_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30911-6

  • Online ISBN: 978-3-540-32425-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation