Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)

DOI10.2168/LMCS-9(1:10)2013zbMath1260.68269arXiv1207.2479OpenAlexW2002981190MaRDI QIDQ4913773

Petr Jančar

Publication date: 9 April 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2479

zbMATH Keywords

complexitybisimulation equivalencebasic process algebra

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)

Related Items (6)

Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Nested session types ⋮ Deciding the Bisimilarity of Context-Free Session Types ⋮ Unnamed Item ⋮ Bisimilarity on basic parallel processes

This page was built for publication: Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)