Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences

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.

[1]  Bas Luttik,et al.  Decomposition orders another generalisation of the fundamental theorem of arithmetic , 2004, Theor. Comput. Sci..

[2]  Petr Janÿcar,et al.  On distributed bisimilarity over Basic Parallel Processes 1 , 2005 .

[3]  Richard Mayr.  Decidability and complexity of model checking problems for infinite state systems , 1998 .

[4]  Dung T. Huynh,et al.  Commutative Grammars: The Complexity of Uniform Word Problems , 1984, Inf. Control..

[5]  Twan Basten,et al.  Branching Bisimilarity is an Equivalence Indeed! , 1996, Inf. Process. Lett..

[6]  Petr Jancar,et al.  Strong bisimilarity on basic parallel processes in PSPACE-complete , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[7]  Faron Moller,et al.  A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes , 1994, Mathematical Structures in Computer Science.

[8]  Jirí Srba.  Strong bisimilarity of simple process algebras: complexity lower bounds , 2003, Acta Informatica.

[9]  Jirí Srba.  Complexity of Weak Bisimilarity and Regularity for BPA and BPP , 2000, EXPRESS.

[10]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

[11]  Yoram Hirshfeld,et al.  Bisimulation trees and the decidability of weak bisimulations , 1996, INFINITY.

[12]  Colin Stirling,et al.  Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes , 2001, FoSSaCS.

[13]  Slawomir Lasota.  A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes , 2003, MFCS.

[14]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[15]  Søren Christensen.  Decidability and decomposition in process algebras , 1993 .

[16]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[17]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

[18]  Glynn Winskel,et al.  Synchronization Trees , 1984, Theor. Comput. Sci..

[19]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[20]  P. Jančar,et al.  Bisimilarity on normed Basic Parallel Processes can be decided in time O ( n 3 ) , 2004 .