On Reachability Equivalence for BPP-Nets

Abstract In this paper, we study the complexity of the reachability equivalence problem for BPP-nets. BPP-nets are closely related to Basic Parallel Processes, which form a subclass of Milner's CCS. We show the reachability equivalence problem for BPP-nets to be solvable in DTIME(22ds3), where d is a constant and s is the size of the problem instance, when a standard binary encoding scheme is used. To that end, we provide a new characterization for computations in BPP-nets, which, in turn, facilitates the derivation of small semilinear set representations for the reachability sets of BPP-nets. As for the lower bound, the problem is shown to be Πp2-hard. Our results improve upon the previous decidability result of the reachability equivalence problem for BPP-nets.

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

[2]  Hideki Yamasaki.  Normal Petri Nets , 1984, Theor. Comput. Sci..

[3]  Yoram Hirshfeld,et al.  Petri Nets and the Equivalence Problem , 1993, CSL.

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

[5]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[6]  Hans Hüttel,et al.  Undecidable equivalences for basic parallel processes , 1994, Inf. Comput..

[7]  Faron Moller,et al.  Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

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

[9]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[10]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[11]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[12]  Dung T. Huynh.  The Complexity of Equivalence Problems for Commutative Grammars , 1985, Inf. Control..

[13]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1997, Fundam. Informaticae.

[14]  Thiet-Dung Huynh.  The Complexity of Semilinear Sets , 1982, J. Inf. Process. Cybern..

[15]  Søren Christensen,et al.  Decidability issues for infinite-state processes- a survey , 1993, Bull. EATCS.

[16]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[17]  Dung T. Huynh.  A Simple Proof for the Sump2 Upper Bound of the Inequivalence Problem for Semilinear Sets , 1986, J. Inf. Process. Cybern..