Decidability of branching bisimulation on normed commutative context-free processes

DOI10.1007/s00224-013-9505-9zbMath1319.68147OpenAlexW1983845977WikidataQ59394498 ScholiaQ59394498MaRDI QIDQ2254493

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

Publication date: 5 February 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9505-9

zbMATH Keywords

equivalence checkingbasic parallel processesbranching bisimulation equivalencecommutative context-free graphs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item, Bisimilarity on basic parallel processes

Cites Work

• Decidability of performance equivalence for basic parallel processes
• Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
• Branching time and abstraction in bisimulation semantics
• 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
• Unnamed Item
• Unnamed Item