Expressiveness of Process Algebras

Electronic Notes in Theoretical Computer Science

Volumn 209, Issue C, 2008, Pages 173-186

  Parrow, Joachim ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

expressiveness; Process algebra

Indexed keywords

COMPUTER SCIENCE; PROBLEM SOLVING;

EXPRESSIVENESS; PROCESS ALGEBRA;

ALGEBRA;

EID: 42949146424     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.04.011     Document Type: Article

References (19)

1. Baeten J.C.M., Bergstra J.A., and Klop J.W. On the consistency of koomen's fair abstraction rule. Theor. Comput. Sci. 51 (1987) 129-176
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 M., Parrow J., and Victor B. A fully abstract encoding of the pi-calculus with data terms. In: Caires L., Italiano G.F., Monteiro L., Palamidessi C., and Yung M. (Eds). Lecture Notes in Computer Science volume 3580 (2005), Springer 1202-1213
4. Cacciagrano D., Corradini F., and Palamidessi C. Separation of synchronous and asynchronous communication via testing. Electr. Notes Theor. Comput. Sci. 154 3 (2006) 95-108
5. de Simone R. Higher-level synchronising devices in meije-sccs. Theor. Comput. Sci. 37 (1985) 245-267
6. Laneve C., and Victor B. Solos in concert. In: Wiedermann J., van Emde Boas P., and Nielsen M. (Eds). ICALP. Lecture Notes in Computer Science volume 1644 (1999), Springer 513-523
7. Nestmann U. What is a good encoding of guarded choice?. Inf. Comput. 156 1-2 (2000) 287-319
8. Nestmann U., and Pierce B.C. Decoding choice encodings. Inf. Comput. 163 1 (2000) 1-69
9. Catuscia Palamidessi. Comparing the expressive power of the synchronous and the asynchronous pi-calculus. In POPL, pages 256-265, 1997
10. Palamidessi C. Comparing the expressive power of the synchronous and asynchronous pi-calculi. Mathematical Structures in Computer Science 13 5 (2003) 685-719
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 J. The expressive power of simple parallelism. In: Odijk E., Rem M., and Syre J.-C. (Eds). PARLE (2). Lecture Notes in Computer Science volume 366 (1989), Springer 389-405
13. Parrow J. The expressive power of parallelism. Future Generation Computer Systems 6 (1990) 271-285
14. Parrow J. Trios in concert. Proof, Language and Interaction, Essays in Honour of Robin Milner (2000), MIT Press 621-637
15. Quaglia P., and Walker D. On synchronous and asynchronous mobile processes. In: Tiuryn J. (Ed). FoSSaCS. Lecture Notes in Computer Science volume 1784 (2000), Springer 283-296
16. Sangiorgi D. From pi-calculus to higher-order pi-calculus - and back. In: Gaudel M.-C., and Jouannaud J.-P. (Eds). TAPSOFT. Lecture Notes in Computer Science volume 668 (1993), Springer 151-166
17. Vaandrager F.W. Expressive results for process algebras. In: de Bakker J.W., de Roever W.P., and Rozenberg G. (Eds). REX Workshop. Lecture Notes in Computer Science volume 666 (1992), Springer 609-638
18. Yoshida N. Minimality and separation results on asynchronous mobile processes: Representability theorems by concurrent combinators (extended abstract). In: Sangiorgi D., and de Simone R. (Eds). CONCUR. Lecture Notes in Computer Science volume 1466 (1998), Springer 131-146
19. Yoshida N. Minimality and separation results on asynchronous mobile processes - representability theorems by concurrent combinators. Theor. Comput. Sci. 274 1-2 (2002) 231-276