Process Algebra with Partial Choice

  • J. C. M. Baeten
  • J. A. Bergstra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 836)


The objective of this paper is to bridge the gap between ACP and TCSP. To this end, ACP is extended with two non-deterministic choice operators in a setting of bisimulation semantics. With these operators, we can express safety properties of systems without the use of silent steps, and we can verify safety properties in a setting in which no assumption on fairness (or unfairness) has been made.


Basic Term Process Algebra Choice Operator Outgoing Transition Dynamic Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BAB88]
    J.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra, I & C 78, 1988, pp. 205–245.zbMATHMathSciNetGoogle Scholar
  2. [BAB94]
    J.C.M. Baeten & J.A. Bergstra, On sequential composition, action prefixes and process prefix, to appear in Fac 6 (3), 1994.Google Scholar
  3. [BABK87]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Ready trace semantics for concrete process algebra with priority operator, The Computer Journal 30 (6), 1987, pp. 498–506.CrossRefzbMATHMathSciNetGoogle Scholar
  4. [BABS92]
    J.C.M. Baeten, J.A. Bergstra & S.A. Smolka, Axiomatizing probabilistic processes: Acp with generative probabilities, in Proc. Concur’92, Stony Brook (W.R. Cleaveland, ed.), Lncs 630, Springer Verlag 1992, pp. 472–485.Google Scholar
  5. [BAW90]
    J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.Google Scholar
  6. [BAZ82]
    J.W. DE Bakker & J.I. Zucker, Processes and the denotational semantics of concurrency, I & C 54, pp. 70–120.Google Scholar
  7. [BEK84]
    J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, pp. 109–137.Google Scholar
  8. [BEKO88]
    J.A. Bergstra, J.W. Klop & E.-R. Olderog, Readies and failures in the algebra of communicating processes, Siam J. of Comp. 17 (6), 1988, pp. 1134–1177.CrossRefzbMATHMathSciNetGoogle Scholar
  9. [BRHR84]
    S.D. Brookes, C.A.R. Hoare & W. Roscoe, A theory of communicating sequential processes, Jacm 31, 1984, pp. 560–599.CrossRefzbMATHMathSciNetGoogle Scholar
  10. [HAN91]
    H. Hansson, Time and probability in formal design of distributed systems, Ph.D. thesis, DoCS 91/27, Univ. of Uppsala 1991.Google Scholar
  11. [HAJ90]
    H. Hansson & B. Jonsson, A calculus for communicating systems with time and probabilities, in Proc. Rtss90, Orlando, Ieee Computer Society Press 1990.Google Scholar
  12. [HEN88]
    M. Hennessy, Algebraic theory of processes, Mit Press 1988.Google Scholar
  13. [HOA85]
    C.A.R. Hoare, Communicating sequential processes, Prentice Hall 1985.Google Scholar
  14. [JON93]
    B. Jonsson, Probabilistic processes, notes of a tutorial at Concur’93, Hildesheim 1993.Google Scholar
  15. [LAT88]
    K.G. Larsen & B. Thomsen, A modal process logic, in Proc. Lics’88, 1988.Google Scholar
  16. [MIL80]
    R. Milner, A calculus of communicating systems, Lncs92, Springer 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • J. C. M. Baeten
    • 1
  • J. A. Bergstra
    • 2
    • 3
  1. 1.Department of Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Programming Research GroupUniversity of AmsterdamAmsterdamThe Netherlands
  3. 3.Department of PhilosophyUtrecht UniversityUtrechtThe Netherlands

Personalised recommendations