Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences

Authors:
Sibylle Fröschle;Sławomir Lasota
Affiliations:
Department für Informatik, Universität Oldenburg, 26111 Oldenburg, Germany;Institute of Informatics, Warsaw University, 02--097 Warszawa, Banacha 2, Poland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 4

Commutative grammars: the complexity of uniform word problems

Information and Control
Branching bisimilarity is an equivalence indeed!

Information Processing Letters
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Petri nets, commutative context-free grammars, and basic parallel processes

Fundamenta Informaticae
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Complexity of weak bisimilarity and regularity for BPA and BPP

Mathematical Structures in Computer Science
Decomposition orders: another generalisation of the fundamental theorem of arithmetic

Theoretical Computer Science - Process algebra

Non-interleaving bisimulation equivalences on Basic Parallel Processes

Information and Computation
Partially-commutative context-free processes: Expressibility and tractability

Information and Computation
Decidability of branching bisimulation on normed commutative context-free processes

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Unique parallel decomposition in branching and weak bisimulation semantics

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a decision procedure for a general class of normed commutative process rewrite systems and their induced bisimulation equivalences. Our technique is inspired by the polynomial-time algorithm for strong bisimilarity on normed Basic Parallel Processes (BPP), developed by Hirshfeld, Jerrum and Moller. As part of our framework we present a generic unique decomposition result, which we obtain by building on a characterization by Luttik and van Oostrom. We apply our general technique to derive polynomial-time algorithms for strong bisimilarity on normed BPP with communication and for distributed bisimilarity on all BPP with communication. Moreover, our technique yields a PSPACE upper bound for weak and branching bisimilarity on totally normed BPP.