Complexity of Checking Bisimilarity between Sequential and Parallel Processes

DOI10.1007/978-3-642-40313-2_28zbMath1398.68361OpenAlexW62085437MaRDI QIDQ2849919

Martin Kot, Zdeněk Sawa, Wojciech Czerwiński, Petr Jančar

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Complexity of Checking Bisimilarity between Sequential and Parallel Processes