On the expressive power of recursion, replication and iteration in process calculi

DOI10.1017/S096012950999017XzbMath1191.68430OpenAlexW2019102125MaRDI QIDQ3655762

Gianluigi Zavattaro, Maurizio Gabbrielli, Nadia Busi

Publication date: 12 January 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012950999017x

zbMATH Keywords

bisimulation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ When to Move to Transfer Nets ⋮ Reactive Turing machines ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Replications in reversible concurrent calculi ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ Unnamed Item ⋮ Replacement freeness: a criterion for separating process calculi ⋮ Unnamed Item ⋮ Turing universality of the Biochemical Ground Form ⋮ An algebraic theory for web service contracts ⋮ The Decidability of the Reachability Problem for CCS! ⋮ On the computational power of BlenX ⋮ On the expressiveness of π-calculus for encoding mobile ambients ⋮ Concurrencies in reversible concurrent calculi

Cites Work

• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• A calculus of mobile processes. I
• Computability of Recursive Functions
• Ordering by Divisibility in Abstract Algebras
• Well-structured transition systems everywhere!