Skip to main content
SpringerLink
Log in

An ω-Complete Equational Specification of Interleaving

Extended Abstract

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

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

Included in the following conference series:

Abstract

We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not ω-complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an ω- complete specification, which is finite in a setting with finitely many actions.

A full version that contains the omitted proofs is available as CWI Technical Report; see http://www.cwi.nl/luttik/

Research supported by the Netherlands Organization for Scientific Research (NWO) under contract SION 612-33-008.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aceto, L. and Hennessy, M. (1993). Towards action-refinement in process algebras. Information and Computation, 103(2), 204–269.

    Article  MATH  MathSciNet  Google Scholar 

  • Baeten, J. C. M. and Weijland, W. P. (1990). Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Castellani, I. and Hennessy, M. (1989). Distributed bisimulations. Journal of the ACM, 36(4), 887–911.

    Article  MATH  MathSciNet  Google Scholar 

  • Groote, J. F. (1990). A new strategy for proving ω-completeness applied to process algebra. In J. Baeten and J. Klop, editors, Proceedings of CONCUR’90, volume 458 of LNCS, pages 314–331, Amsterdam. Springer-Verlag.

    Google Scholar 

  • Heering, J. (1986). Partial evaluation and ω-completeness of algebraic specifications. Theoretical Computer Science, 43, 149–167.

    Article  MATH  MathSciNet  Google Scholar 

  • Hennessy, M. (1988). Axiomatising finite concurrent processes. SI AM Journal of Computing, 17(5), 997–1017.

    Article  MATH  MathSciNet  Google Scholar 

  • Hirshfeld, Y. and Jerrum, M. (1998). Bisimulation equivalence is decidable for normed process algebra. LFCS Report ECS-LFCS-98-386, University of Edinburgh.

    Google Scholar 

  • Hirshfeld, Y. and Jerrum, M. (1999). Bisimulation equivalence is decidable for normed process algebra. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Proceedings of ICALP’99, volume 1644 of LNCS, pages 412–421, Prague. Springer.

    Google Scholar 

  • Lazrek, A., Lescanne, P., and Thiel, J.-J. (1990). Tools for proving inductive equalities, relative completeness, and ω-completeness. Information and Computation, 84(1), 47–70.

    Article  MathSciNet  Google Scholar 

  • Milner, R. (1989). Communication and Concurrency. Prentice-Hall International, Englewood Cliffs.

    MATH  Google Scholar 

  • Milner, R. and Moller, F. (1993). Unique decomposition of processes. Theoretical Computer Science, 107, 357–363.

    Article  MATH  MathSciNet  Google Scholar 

  • Moller, F. (1989). Axioms for Concurrency. Ph.D. thesis, University of Edinburgh.

    Google Scholar 

  • Moller, F. (1990). The importance of the left merge operator in process algebras. In M. Paterson, editor, Proceedings of ICALP’90, volume 443 of LNCS, pages 752–764, Warwick. Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, P.O. Box 94079, NL-1090 GB, Amsterdam, The Netherlands

    W. J. Fokkink & S. P. Luttik

  2. Department of Computer Science, University of Amsterdam, Kruislaan 403, NL-1098 SJ, Amsterdam, The Netherlands

    S. P. Luttik

Authors
  1. W. J. Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. P. Luttik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sciences, University of Pisa, Corso Italia, 40, 56125, Pisa, Italy

    Ugo Montanari

  2. Center for Computer Sciences, University of Geneva, 24, Rue Général Dufour, 1211, Geneva 4, Switzerland

    José D. P. Rolim

  3. Department of Computer Sciences, ETH Zurich, 8092, Zurich, Switzerland

    Emo Welzl

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fokkink, W.J., Luttik, S.P. (2000). An ω-Complete Equational Specification of Interleaving. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-45022-X_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45022-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation