On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
The expressive power of parallelism
Future Generation Computer Systems - Parallel computing
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Information and Computation
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Expressive Power of Simple Parallelism
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On Synchronous and Asynchronous Mobile Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Expressive Results for Process Algebras
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Spi Calculus Translated to "--Calculus Preserving May-Tests
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A fully abstract encoding of the π-calculus with data terms
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Comparing communication primitives via their relative expressive power
Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Correctly translating concurrency primitives
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Information and Computation
| Hi-index | 0.00 |
We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.