Expressiveness of Process Algebras
From MaRDI portal
Publication:2870198
DOI10.1016/j.entcs.2008.04.011zbMath1279.68264OpenAlexW2021990421MaRDI QIDQ2870198
Publication date: 17 January 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.011
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (27)
Session-based concurrency, declaratively ⋮ On the Expressiveness of Symmetric Communication ⋮ The true concurrency of differential interaction nets ⋮ Comparing type systems for deadlock freedom ⋮ Reactive Turing machines ⋮ Unnamed Item ⋮ Translation of CCS into CSP, correct up to strong bisimulation ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Expressiveness of concurrent intensionality ⋮ Breaking symmetries ⋮ Synchrony versus causality in distributed systems ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Unnamed Item ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ A taxonomy of process calculi for distribution and mobility ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ On the relative expressiveness of higher-order session processes ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Comparing communication primitives via their relative expressive power ⋮ On primitives for compensation handling as adaptable processes ⋮ Unnamed Item ⋮ On parameterization of higher-order processes ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
Cites Work
- Higher-level synchronising devices in Meije-SCCS
- On the consistency of Koomen's fair abstraction rule
- What is a ``good encoding of guarded choice?
- Decoding choice encodings
- From π-calculus to higher-order π-calculus — and back
- Automata, Languages and Programming
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Expressiveness of Process Algebras
