On the Expressive Power of Restriction and Priorities in CCS with Replication

DOI10.1007/978-3-642-00596-1_18zbMath1234.68284OpenAlexW1594682236MaRDI QIDQ3617733

Frank D. Valencia, Jesús Aranda, Cristian Versari

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_18

Mathematics Subject Classification ID

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

Related Items (8)

A Formal Model for Polarization under Confirmation Bias in Social Networks ⋮ When to Move to Transfer Nets ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Replacement freeness: a criterion for separating process calculi ⋮ On the Expressive Power of Restriction and Priorities in CCS with Replication ⋮ The Decidability of the Reachability Problem for CCS! ⋮ On the computational power of BlenX

Cites Work

• Finite representations of CCS and TCSP programs by automata and Petri nets
• CCS with priority guards
• Decidability of bisimulation equivalence for process generating context-free languages
• CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
• On the Expressive Power of Global and Local Priority in Process Calculi
• Termination Problems in Chemical Kinetics
• On the Expressive Power of Restriction and Priorities in CCS with Replication
• A Theory of Communicating Sequential Processes
• On the decidability of fragments of the asynchronous π-calculus
• Foundations of Software Science and Computation Structures
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Expressive Power of Restriction and Priorities in CCS with Replication