Skip to main content
SpringerLink
Log in

Discrete time process algebra with abstraction

  • Invited Lectures
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1995)

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

Included in the following conference series:

Abstract

The axiom system ACP of [BEK84a] was extended to discrete time in [BAB95]. Here we proceed to define the silent step in this theory in branching bisimulation semantics [GLW91, BAW90] rather than weak bisimulation semantics [MIL89, BEK85]. We present versions based on relative timing and on absolute timing. Both approaches are integrated using parametric timing. The time free ACP theory is embedded in the discrete time theory.

Partial support received from ESPRIT Basic Research Action 7166, CONCUR2.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M. Baeten & J.A. Bergstra, Real time process algebra, Formal Aspects of Computing 3 (2), 1991, pp. 142–188.

    Article  Google Scholar 

  2. J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra (extended abstract), in: Proc. CONCUR'92, Stony Brook (W.R. Cleaveland, ed.), LNCS 630, Springer 1992, pp. 401–420.

    Google Scholar 

  3. J.C.M. Baeten & J.A. Bergstra, Real space process algebra, Formal Aspects of Computing 5 (6), 1993, pp. 481–529.

    Google Scholar 

  4. J.C.M. Baeten & J.A. Bergstra, On sequential composition, action prefixes and process prefix, Formal Aspects of Computing 6 (3), 1994, pp. 250–268.

    Google Scholar 

  5. J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra, report P9208c, Programming Research Group, University of Amsterdam 1995. To appear in Formal Aspects of Computing.

    Google Scholar 

  6. J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theor. Comp. Sci. 18, Cambridge University Press 1990.

    Google Scholar 

  7. J.A. Bergstra & J.W. Klop, Algebra of communicating processes with abstraction, TCS 37 (1), 1985, pp. 77–121.

    Article  Google Scholar 

  8. J.A. Bergstra & J.W. Klop, Verification of an alternating bit protocol by means of process algebra, in: Math. Methods of Spec. and Synthesis of Software Systems '85 (W. Bibel & K.P. Jantke, eds.), Springer LNCS 215, 1986, pp. 9–23.

    Google Scholar 

  9. J.A. Bergstra & P. Klint, The toolbus — a component interconnection architecture-, report P9408, Programming Research Group, University of Amsterdam 1994.

    Google Scholar 

  10. J.A. Bergstra & P. Klint, The discrete time toolbus, report P9502, Programming Research Group, University of Amsterdam 1995.

    Google Scholar 

  11. J.A. Bergstra & C.A. Middelburg, A process algebra semantics for φSDL, report LGPS 129, Dept. of Philosophy, Utrecht University 1995.

    Google Scholar 

  12. S.D. Brookes, C.A.R. Hoare & A.W. Roscoe, A theory of communicating sequential processes, Journal of the ACM 31 (3), 1984, pp. 560–599.

    Article  Google Scholar 

  13. R.J. van Glabbeek & W.P. Weijland, Branching time and abstraction in bisimulation semantics, CWI report CS-R9120, 1991.

    Google Scholar 

  14. J.F. Groote, Specification and verification of real time systems in ACP, in: Proc. 10th Symp. on Protocol Specification, Testing and Verification, Ottawa (L. Logrippo, R.L. Probert & H. Ural, eds.), North-Holland, Amsterdam 1990, pp. 261–274.

    Google Scholar 

  15. M. Hennessy & T. Regan, A temporal process algebra, report 2/90, University of Sussex 1990.

    Google Scholar 

  16. A.S. Klusener, Models and axioms for a fragment of real time process algebra, Ph.D. Thesis, Eindhoven University of Technology 1993.

    Google Scholar 

  17. R. Milner, Communication and concurrency, Prentice-Hall 1989.

    Google Scholar 

  18. F. Moller & C. Tofts, A temporal calculus of communicating systems, report LFCS-89-104, University of Edinburgh 1989.

    Google Scholar 

  19. F. Moller & C. Tofts, A temporal calculus of communicating systems, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten & J.W. Klop, eds.), LNCS 458, Springer 1990, pp. 401–415.

    Google Scholar 

  20. X. Nicollin & J. Sifakis, The algebra of timed processes ATP: theory and application, Information & Computation 114, 1994, pp. 131–178.

    Google Scholar 

  21. X. Nicollin, J.-L. Richier, J. Sifakis & J. Voiron, ATP: an algebra for timed processes, in Proc. IFIP TC2 Conf. on Progr. Concepts & Methods, Sea of Gallilee, Israel 1990.

    Google Scholar 

  22. G.M. Reed & A.W. Roscoe, A timed model for communicating sequential processes, TCS 58, 1988, pp. 249–261.

    Google Scholar 

  23. C. Verhoef, A congruence theorem for structured operational semantics with predicates and negative premises, in: Proc. CONCUR'94, Uppsala (B. Jonsson & J. Parrow, eds.), Springer LNCS 836, 1994, pp. 433–448.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600, MB Eindhoven, The Netherlands

    J. C. M. Baeten

  2. Programming Research Group, University of Amsterdam, Kruislaan 403, 1098, SJ Amsterdam, The Netherlands

    J. A. Bergstra

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

    J. A. Bergstra

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

    You can also search for this author in PubMed Google Scholar

  2. J. A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeten, J.C.M., Bergstra, J.A. (1995). Discrete time process algebra with abstraction. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation