Skip to main content
SpringerLink
Log in

Process Algebra with Partial Choice

  • Conference paper
CONCUR ’94: Concurrency Theory (CONCUR 1994)

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

Included in the following conference series:

Abstract

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.

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.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra, I & C 78, 1988, pp. 205–245.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. 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. J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.

    Google Scholar 

  6. J.W. DE Bakker & J.I. Zucker, Processes and the denotational semantics of concurrency, I & C 54, pp. 70–120.

    Google Scholar 

  7. J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, pp. 109–137.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. S.D. Brookes, C.A.R. Hoare & W. Roscoe, A theory of communicating sequential processes, Jacm 31, 1984, pp. 560–599.

    Article  MATH  MathSciNet  Google Scholar 

  10. H. Hansson, Time and probability in formal design of distributed systems, Ph.D. thesis, DoCS 91/27, Univ. of Uppsala 1991.

    Google Scholar 

  11. 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. M. Hennessy, Algebraic theory of processes, Mit Press 1988.

    Google Scholar 

  13. C.A.R. Hoare, Communicating sequential processes, Prentice Hall 1985.

    Google Scholar 

  14. B. Jonsson, Probabilistic processes, notes of a tutorial at Concur’93, Hildesheim 1993.

    Google Scholar 

  15. K.G. Larsen & B. Thomsen, A modal process logic, in Proc. Lics’88, 1988.

    Google Scholar 

  16. R. Milner, A calculus of communicating systems, Lncs92, Springer 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB, Eindhoven, The Netherlands

    J. C. M. Baeten

  2. Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    J. A. Bergstra

  3. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    J. A. Bergstra

Authors
  1. J. C. M. Baeten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Systems, Uppsala University, P.O. Box 325, S-751 05, Uppsala, Sweden

    Bengt Jonsson

  2. Swedish Institute of Computer Science, P.O. Box 1262, S-164 28, Kista, Sweden

    Joachim Parrow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeten, J.C.M., Bergstra, J.A. (1994). Process Algebra with Partial Choice. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48654-1_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58329-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation