Partially-Commutative Context-Free Processes
From MaRDI portal
Publication:3184678
DOI10.1007/978-3-642-04081-8_18zbMath1254.68164MaRDI QIDQ3184678
Wojciech Czerwiński, Sławomir Lasota, Sibylle Fröschle
Publication date: 22 October 2009
Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_18
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Bisimulation equivalence is decidable for all context-free processes
- Normed BPA vs. Normed BPP Revisited
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
- Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item