Partially-commutative context-free processes: Expressibility and tractability

Authors:
Wojciech Czerwiński;Sibylle Fröschle;Sławomir Lasota
Affiliations:
Institute of Informatics, University of Warsaw, Warsaw, Poland;Universität Oldenburg, Fakultät II, Department für Informatik, 26111 Oldenburg, Germany;Institute of Informatics, University of Warsaw, Warsaw, Poland
Venue:
Information and Computation
Year:
2011

Citing 10
Cited 2

Bisimulation equivalence is decidable for all context-free processes

Information and Computation
A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
The Book of Traces

The Book of Traces
Bisimulation Equivanlence Is Decidable for Normed Process Algebra

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Normed BPA vs. Normed BPP Revisited

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences

Electronic Notes in Theoretical Computer Science (ENTCS)
Partially-Commutative Context-Free Processes

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Faster algorithm for bisimulation equivalence of normed context-free processes

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Reachability problem for weak multi-pushdown automata

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A Hierarchy of Languages with Catenation and Shuffle

Fundamenta Informaticae - Concurrency, Specification and Programming

Quantified Score

Hi-index	0.00

Visualization

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 algorithmic 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. Expressibility issue of the new class, in comparison with the normed PA class, is also tackled in the paper.