Merge and termination in process algebra

  • J. C. M. Baeten
  • R. J. van Glabbeek
Session 3 Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)

Abstract

In VRANCKEN [14], the empty process ɛ was added to the Algebra of Communicating Processes of BERGSTRA & KLOP [3, 4]. Reconsidering the definition of the parallel composition operator merge, we found that it is preferable to explicitly state the termination option. This gives an extra summand in the defining equation of merge, using the auxiliary operator √ (tick). We find that tick can be defined in terms of the encapsulation operator ∂H. We give an operational and a denotational semantics for the resulting system ACP√, and prove that they are equal. We consider the Limit Rule, and prove it holds in our models.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra, report CS-R8521, Centre for Math. & Comp. Sci., Amsterdam 1985. To appear in Inf. & Computation.Google Scholar
  2. [2]
    J.A. Bergstra & J.W. Klop, Fixed point semantics in process algebras, report IW 206, Mathematical Centre, Amsterdam 1982.Google Scholar
  3. [3]
    J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60 (1/3), pp. 109–137, 1984.Google Scholar
  4. [4]
    J.A. Bergstra & J.W. Klop, Algebra of communicating processes, in: Proc. CWI Symp. Math. & Comp. Sci. (J.W. de Bakker, M. Hazewinkel & J.K. Lenstra, eds.), pp. 89–138, North-Holland, Amsterdam 1986.Google Scholar
  5. [5]
    J.A. Bergstra, J.W. Klop & E.-R. Olderog, Failures without chaos: a new process semantics for fair abstraction, in: Proc. IFIP Conf. on Formal Description of Programming Concepts-III, Ebberup 1986, (M. Wirsing, ed.), North-Holland, Amsterdam, pp. 77–103, 1987.Google Scholar
  6. [6]
    J.A. Bergstra & J.V. Tucker, Top down design and the algebra of communicating processes, Sci. of Comp. Progr. 5 (2), pp. 171–199, 1985.CrossRefGoogle Scholar
  7. [7]
    R.J. van Glabbeek, Bounded nondeterminism and the approximation induction principle in process algebra, in: Proc. STACS 87 (F.J.Brandenburg, G.Vidal-Naquet & M.Wirsing eds.), Springer LNCS 247, pp. 336–347, 1987.Google Scholar
  8. [8]
    C.A.R.Hoare, Communicating sequential processes, Prentice Hall 1985.Google Scholar
  9. [9]
    C.P.J. Koymans & J.L.M. Vrancken, Extending process algebra with the empty process ɛ, report LGPS 1, Dept. of Philosophy, State University of Utrecht, The Netherlands 1985.Google Scholar
  10. [10]
    R.Milner, A calculus of communicating systems, Springer LNCS 92, 1980.Google Scholar
  11. [11]
    R. Milner, Lectures on a calculus of communicating systems, in: Seminar on concurrency (S.D.Brookes, A.W.Roscoe & G.Winskel, eds.), Springer LNCS 197, pp. 197–220, 1985.Google Scholar
  12. [12]
    D.M.R. Park, Concurrency and automata on infinite sequences, in: Proc. 5th GI Conf. (P.Deussen, ed.), Springer LNCS 104, pp. 167–183, 1981.Google Scholar
  13. [13]
    G. Plotkin, An operational semantics for CSP, in: Proc. Conf. Formal Description of Progr. Concepts II (D. Bjørner, ed.), pp. 199–223, North-Holland, Amsterdam 1982.Google Scholar
  14. [14]
    J.L.M.Vrancken, The algebra of communicating processes with empty process, report FVI 86-01, Dept. of Comp. Sci., Univ. of Amsterdam 1986.Google Scholar
  15. [15]
    F.W. Vaandrager, Process algebra semantics of POOL, report CS-R8629, Centre for Math. & Comp. Sci., Amsterdam 1986.Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • J. C. M. Baeten
    • 1
  • R. J. van Glabbeek
    • 2
  1. 1.Dept. of Computer ScienceUniversity of AmsterdamAmsterdamThe Netherlands
  2. 2.Dept. of Software TechnologyCentre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations