Skip to main content
SpringerLink
Log in

Polarized Process Algebra and Program Equivalence

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2003)

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

Included in the following conference series:

Abstract

The basic polarized process algebra is completed yielding as a projective limit a cpo which also comprises infinite processes. It is shown that this model serves in a natural way as a semantics for several program algebras. In particular, the fully abstract model of the program algebra axioms of [2] is considered which results by working modulo behavioral congruence. This algebra is extended with a new basic instruction, named ‘entry instruction’ and denoted with ‘@’. Addition of @ allows many more equations and conditional equations to be stated. It becomes possible to find an axiomatization of program inequality. Technically this axiomatization is an infinite final algebra specification using conditional equations and auxiliary objects.

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. J.A. Bergstra and J.-W. Klop. Process algebra for synchronous communication. Information and Control, 60(1/3):109–137, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.A. Bergstra and M.E. Loots. Program algebra for component code. Formal Aspects of Computing, 12(1):1–17, 2000.

    Article  MATH  Google Scholar 

  3. J.A. Bergstra and M.E. Loots. Program algebra for sequential code. Journal of Logic and Algebraic Programming, 51(2):125–156, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  4. J.A. Bergstra and J.V. Tucker. Equational specifications, complete rewriting systems and computable and semi-computable algebras. Journal of the ACM, 42(6):1194–1230, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. I. Bethke. Completion of equational specifications. In Terese, editors, Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science 55, pages 260–300, Cambridge University Press, 2003.

    Google Scholar 

  6. S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(8):560–599, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurreny. Information and Control, 54(1/2):70–120, 1982.

    MATH  MathSciNet  Google Scholar 

  8. W.J. Fokkink. Axiomatizations for the perpetual loop in process algebra. In P. Degano, R. Gorrieri, and A. Machetti-Spaccamela, editors, Proceedings of the 24-th ICALP, ICALP’97, Lecture Notes in Comp. Sci. 1256, pages 571–581. Springer Berlin, 1997.

    Google Scholar 

  9. J.-W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, volume II, pages 1–116. Oxford University Press, 1992.

    MathSciNet  Google Scholar 

  10. A. Ponse. Program algebra with unit instruction operators. Journal of Logic and Algebraic Programming, 51(2):157–174, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  11. V. Stoltenberg-Hansen, I. Lindström, and E.R. Griffor. Mathematical Theory of Domains, Cambridge Tracts in Theoretical Computer Science 22, Cambridge University Press, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Applied Logic Group, Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Jan A. Bergstra

  2. Programming Research Group, Informatics Institute, Faculty of Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Jan A. Bergstra & Inge Bethke

Authors
  1. Jan A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inge Bethke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergstra, J.A., Bethke, I. (2003). Polarized Process Algebra and Program Equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation