Abstract
In the context of structured operational semantics, a useful measure of the expressive power of a process algebra \(\mathcal{P}\)is the class of operator specifications definable in \(\mathcal{P}\)up to a given equivalence. Our goal in this study is to characterize this class of operators for CCS up to strong and branching bisimulation. We use our results to motivate modifications to CCS to eliminate awkward constraints on expressiveness. In particular, we present a strong case for adding a checkpointing operator.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Tommaso Bolognesi and Ed Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.
Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced (preliminary report). In Proceedings of POPL 1988, pages 229–239. IEEE Press, 1988.
Bard Bloom. Structural operational semantics for weak bisimulations. Technical Report TR 93-1373, Cornell, August 1993. To appear in Theoretical Computer Science.
Bard Bloom. Structural operational semantics considered as a specification language. In Proceedings of POPL 1995, pages 107–117. IEEE Press, 1995.
G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261–303. Springer-Verlag, 1985. NATO ASI Series F13.
W. Baeten and P. Weijland. Process Algebra. Cambridge University Press, 1991.
Ashvin Dsouza and Bard Bloom. Towards a basis for GSOS. Unpublished manuscript, 1993.
Ashvin Dsouza and Bard Bloom. On the expressive power of ccs, 1995. http: //www.cs.cornell.edu/Info/People/dsouza/ccs-expr.ps.
R. de Simone. Higher-level synchronizing devices in MEIJE-SCCS. Theoretical Computer Science, 37(3):245–267, 1985.
Jan Friso Groote and Frits Vaandrager. Structured operational semantics and bisimulation as a congruence (extended abstract). In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Delia Rocca, editors, Automata, Languages and Programming: 16th International Colloquium, volume 372 of Lect. Notes in Computer Sci., pages 423–438. Springer-Verlag, 1989.
C. A. Hoare. Communicating Sequential Processes. Prenctice Hall, 1985.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, page 261. Springer-Verlag, 1981.
J. Parrow. The expressive power of parallelism. Future Generation Computer Systems, 6:271–285, 1990.
G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Sci., 5(3):223–255, 1977.
Frits Vaandrager. Expressiveness results for process algebras. In de Bakker, de Roever, and Rozenberg, editors, Semantics: Foundations and Applications, pages 609–620. Springer-Verlag, 1993. LNCS 666.
Rob van Glabbeek. A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In Symposium on Mathematical Foundations of Computer Science '93. Springer Verlag, 1993. LNCS 711.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dsouza, A., Bloom, B. (1995). On the expressive power of CCS. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_57
Download citation
DOI: https://doi.org/10.1007/3-540-60692-0_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60692-5
Online ISBN: 978-3-540-49263-4
eBook Packages: Springer Book Archive