Partially-commutative context-free processes: expressibility and tractability
From MaRDI portal
Publication:532392
DOI10.1016/j.ic.2010.12.003zbMath1215.68146OpenAlexW1982760143MaRDI QIDQ532392
Sibylle Fröschle, Sławomir Lasota, Wojciech Czerwiński
Publication date: 4 May 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.12.003
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebra of communicating processes with abstraction
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Process rewrite systems.
- Bisimulation equivalence is decidable for all context-free processes
- Partially-Commutative 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