Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes

DOI10.1007/978-3-642-23217-6_35zbMath1343.68164OpenAlexW23983374MaRDI QIDQ3090854

Sławomir Lasota, Wojciech Czerwiński, Piotr Hofman

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_35

Mathematics Subject Classification ID

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

Related Items (2)

Theory of interaction ⋮ Decidability of branching bisimulation on normed commutative context-free processes

Cites Work

• Decidability of performance equivalence for basic parallel processes
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes