Abstract
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA and BPP. It is derived in the setting of partially-commutative context-free processes, a new process class introduced in the paper. It subsumes both BPA and BPP and seems to be of independent interest. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Czerwiński, W., Fröschle, S., & Lasota, S. (2009). Partially-commutative context-free processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5710 LNCS, pp. 259–273). https://doi.org/10.1007/978-3-642-04081-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
