Skip to main content
SpringerLink
Log in

A new strategy for proving ω-completeness applied to process algebra

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

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

Included in the following conference series:

Abstract

A new technique for proving ω-completeness based on proof transformations is presented. This technique is applied to axiom systems for finite, concrete, sequential processes. It turns out that the number of actions is important for these sets to be ω-complete. For the axiom systems for bisimulation and completed trace semantics one action suffices and for traces 2 actions are enough. The ready, failure, ready trace and failure trace axioms are only ω-complete if an infinite number of actions is available. We also consider process algebra with parallelism and show several axiom sets containing the axioms of standard concurrency ω-complete.

The author is supported by the European Communities under RACE project no. 1046, Specification and Programming Environment for Communication Software (SPECS). This article also appears as report CS-R90XX, Centrum voor Wiskunde en Informatica, Amsterdam

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.A. Bergstra and J. Heering. Which data types have ω-complete initial algebra specifications? Technical Report CS-R8958, Center for Mathematics and Computer Science, Amsterdam, December 1989.

    Google Scholar 

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

    Google Scholar 

  3. J.A. Bergstra and J.V. Tucker. Top down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171–199, 1984.

    Google Scholar 

  4. R.J. van Glabbeek. The linear time-branching time spectrum. In J.C.M. Baeten and J.W. Klop, editors, Proceedings Concur90, LNCS, Amsterdam, 1990. Springer Verlag.

    Google Scholar 

  5. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In G.X. Ritter, editor, Information Processing 89, pages 613–618. Elsevier Science Publishers B.V. (North Holland), 1989.

    Google Scholar 

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

    Google Scholar 

  7. M. Hennessy. Axiomatising finite concurrent processes. SIAM Journal of Computing, 17(5):997–1017, 1988.

    Google Scholar 

  8. D. Kapur and D.R. Musser. Proof by consistency. Artificial Intelligence, 31:125–157, 1987.

    Google Scholar 

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

    Google Scholar 

  10. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, 1980.

    Google Scholar 

  11. R. Milner. A complete axiomatisation for observational congruence of finite-state behaviours. Technical Report ECS-LFCS-86-8, University of Edinburgh, Edinburgh, July 1986.

    Google Scholar 

  12. F. Moller. Axioms for Concurrency. PhD thesis, University of Edinburgh, July 1989.

    Google Scholar 

  13. V.L. Murskii. The existence in three-valued logic of a closed class with finite basis, not having a finite complete system of identities. Doklady Akademii Nauk SSSR, 163:815–818, 1965. English translation in: Soviet Mathematics Doklady, 6:1020–1024, 1965.

    Google Scholar 

  14. D.L. Musser. On proving inductive properties of abstract data types. In Proceedings, 7th ACM Symp. on Principles of Programming Languages, pages 154–162, New York, 1980. ACM.

    Google Scholar 

  15. E. Paul. Proof by induction in equational theories with relations between constructors. In B. Courcelle, editor, 9th Coll. on Trees in Algebra and Programming, pages 211–225, Bordeaux, France, 1984. Cambridge University Press, London.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    Jan Friso Groote

Authors
  1. Jan Friso Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Groote, J.F. (1990). A new strategy for proving ω-completeness applied to process algebra. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039068

Download citation

  • DOI: https://doi.org/10.1007/BFb0039068

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation