Strong bisimilarity of simple process algebras: Complexity lower bounds

DOI10.1007/s00236-003-0116-9zbMath1060.68081OpenAlexW1842478026MaRDI QIDQ1424356

Jiří Srba

Publication date: 11 March 2004

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-003-0116-9

zbMATH Keywords

process rewrite systems

Mathematics Subject Classification ID

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

Related Items (5)

Resource Bisimilarity in Petri Nets is Decidable ⋮ Selected Ideas Used for Decidability and Undecidability of Bisimilarity ⋮ Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences ⋮ EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system ⋮ Bisimilarity on basic parallel processes

This page was built for publication: Strong bisimilarity of simple process algebras: Complexity lower bounds