On the decidability of fragments of the asynchronous π-calculus
From MaRDI portal
Publication:4917084
DOI10.1016/S1571-0661(04)00217-8zbMath1260.68253MaRDI QIDQ4917084
Roberto M. Amadio, Charles Meyssonnier
Publication date: 26 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
When ambients cannot be opened, On the Expressive Power of Restriction and Priorities in CCS with Replication
Cites Work
- Unnamed Item
- Unnamed Item
- Undecidability of bisimilarity for Petri nets and some related problems
- A unified approach for deciding the existence of certain petri net paths
- The covering and boundedness problems for vector addition systems
- On bisimulations for the asynchronous \(\pi\)-calculus
- Model checking mobile processes
- A calculus of mobile agents