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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra, I & C 78, 1988, pp. 205–245.
J.C.M. Baeten & J.A. Bergstra, On sequential composition, action prefixes and process prefix, to appear in Fac 6 (3), 1994.
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.
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.
J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.
J.W. DE Bakker & J.I. Zucker, Processes and the denotational semantics of concurrency, I & C 54, pp. 70–120.
J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, pp. 109–137.
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.
S.D. Brookes, C.A.R. Hoare & W. Roscoe, A theory of communicating sequential processes, Jacm 31, 1984, pp. 560–599.
H. Hansson, Time and probability in formal design of distributed systems, Ph.D. thesis, DoCS 91/27, Univ. of Uppsala 1991.
H. Hansson & B. Jonsson, A calculus for communicating systems with time and probabilities, in Proc. Rtss90, Orlando, Ieee Computer Society Press 1990.
M. Hennessy, Algebraic theory of processes, Mit Press 1988.
C.A.R. Hoare, Communicating sequential processes, Prentice Hall 1985.
B. Jonsson, Probabilistic processes, notes of a tutorial at Concur’93, Hildesheim 1993.
K.G. Larsen & B. Thomsen, A modal process logic, in Proc. Lics’88, 1988.
R. Milner, A calculus of communicating systems, Lncs92, Springer 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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