×

zbMATH — the first resource for mathematics

Expressiveness of process algebras. (English) Zbl 1279.68264
Palamidessi, Catuscia (ed.) et al., Proceedings of the LIX colloquium on emerging trends in concurrency theory (LIX 2006), Paris, France, November 13–15, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 209, 173-186 (2008).
Summary: We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
For the entire collection see [Zbl 1276.68023].

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q60 Specification and verification (program logics, model checking, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Baeten, Jos C.M.; Bergstra, Jan A.; Klop, Jan Willem, On the consistency of Koomen’s fair abstraction rule, Theor. comput. sci., 51, 129-176, (1987) · Zbl 0621.68010
[2] Michael Baldamus, Joachim Parrow, and Björn Victor. Spi calculus translated to pi – calculus preserving may-tests. In LICS, pages 22-31. IEEE Computer Society, 2004
[3] Baldamus, Michael; Parrow, Joachim; Victor, Björn, A fully abstract encoding of the pi-calculus with data terms, (), 1202-1213 · Zbl 1085.68594
[4] Cacciagrano, Diletta; Corradini, Flavio; Palamidessi, Catuscia, Separation of synchronous and asynchronous communication via testing, Electr. notes theor. comput. sci., 154, 3, 95-108, (2006) · Zbl 1273.68251
[5] de Simone, Robert, Higher-level synchronising devices in meije-sccs, Theor. comput. sci., 37, 245-267, (1985) · Zbl 0598.68027
[6] Laneve, Cosimo; Victor, Björn, Solos in concert, (), 513-523
[7] Nestmann, Uwe, What is a good encoding of guarded choice?, Inf. comput., 156, 1-2, 287-319, (2000) · Zbl 1046.68625
[8] Nestmann, Uwe; Pierce, Benjamin C., Decoding choice encodings, Inf. comput., 163, 1, 1-69, (2000) · Zbl 1003.68080
[9] Catuscia Palamidessi. Comparing the expressive power of the synchronous and the asynchronous pi-calculus. In POPL, pages 256-265, 1997
[10] Palamidessi, Catuscia, Comparing the expressive power of the synchronous and asynchronous pi-calculi, Mathematical structures in computer science, 13, 5, 685-719, (2003)
[11] Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, and Björn Victor. On the expressiveness of linearity vs persistence in the asychronous pi-calculus. In LICS, pages 59-68. IEEE Computer Society, 2006
[12] Parrow, Joachim, The expressive power of simple parallelism, (), 389-405
[13] Parrow, Joachim, The expressive power of parallelism, Future generation computer systems, 6, 271-285, (1990)
[14] Parrow, Joachim, Trios in concert, (), 621-637
[15] Quaglia, Paola; Walker, David, On synchronous and asynchronous mobile processes, (), 283-296 · Zbl 0961.68092
[16] Sangiorgi, Davide, From pi-calculus to higher-order pi-calculus – and back, (), 151-166
[17] Vaandrager, Frits W., Expressive results for process algebras, (), 609-638
[18] Yoshida, Nobuko, Minimality and separation results on asynchronous mobile processes: representability theorems by concurrent combinators (extended abstract), (), 131-146 · Zbl 0992.68151
[19] Yoshida, Nobuko, Minimality and separation results on asynchronous mobile processes – representability theorems by concurrent combinators, Theor. comput. sci., 274, 1-2, 231-276, (2002) · Zbl 0992.68151
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.