On the Expressive Power of Restriction and Priorities in CCS with Replication
From MaRDI portal
Publication:3617733
DOI10.1007/978-3-642-00596-1_18zbMath1234.68284MaRDI QIDQ3617733
Frank D. Valencia, Cristian Versari, Jesús Aranda
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
On the computational power of BlenX, Encoding Asynchronous Interactions Using Open Petri Nets, On the Expressive Power of Restriction and Priorities in CCS with Replication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
