Computational Complexity of the Place/Transition-Net Symmetry Reduction Method

Computational complexity of the sub-tasks in the symmetry reduction method for Place/Transition-nets is studied. The task of finding the automorphisms (symmetries) of a net is shown to be polynomial time many-one equivalent to the problem of finding the automorphisms of a graph. Deciding whether two markings are symmetric is shown to be a problem equivalent to the graph isomorphism problem. This remains to be the case even if a generator set for the automorphism group of the net is known. The problem of constructing the lexicographically greatest marking symmetric to a given marking (a canonical representative for the marking) is classified to belong to the lower levels of the polynomial hierarchy, namely to be FP NP(logn) - hard but in FP NP . It is also discussed how the self-symmetries of a marking can be exploited. Calculation of such symmetries is classified to be as hard as computing graph automorphism groups. Furthermore, the coverability version of testing marking symmetricity is shown to be an NP-complete problem. It is proven that canonical representative markings and the symmetric coverability problem cannot be combined in a straightforward way.

[1]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2]  Peter Huber,et al.  Towards reachability trees for high-level Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[3]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[4]  Tommi A. Junttila.  Detecting and exploiting data type symmetries of algebraic system nets during reachability analys , 1999 .

[5]  Tuomas Aura,et al.  On the structure of delegation networks , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[6]  Karsten Wolf,et al.  Integrating Low Level Symmetries into Reachability Analysis , 2000, TACAS.

[7]  Keijo Heljanko.  DEADLOCK AND REACHABILITY CHECKING WITH FINITE COMPLETE PREFIXES , 1999 .

[8]  Tommi Syrjanen,et al.  A Rule-Based Formal Model For Software Configuration , 1999 .

[9]  Mark Jerrum,et al.  A compact representation for permutation groups , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  P. H. Starke,et al.  Reachability analysis of Petri nets using symmetries , 1991 .

[11]  Gregory Butler,et al.  Fundamental Algorithms for Permutation Groups , 1991, Lecture Notes in Computer Science.

[12]  Mark W. Krentel.  The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..

[13]  Gary L. Miller,et al.  Graph isomorphism, general remarks , 1977, STOC '77.

[14]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[15]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

[16]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[17]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[18]  Kurt Jensen.  Condensed state spaces for symmetrical Coloured Petri Nets , 1996, Formal Methods Syst. Des..

[19]  Hartmann J. Genrich.  Predicate/transition nets , 1987 .

[20]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[21]  Peter Huber,et al.  Reachability Trees for High-level Petri Nets , 1986, Theor. Comput. Sci..

[22]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[23]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

[24]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[25]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[26]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[27]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[28]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.

[29]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[30]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[31]  B. McKay.  nauty User ’ s Guide ( Version 2 . 4 ) , 1990 .

[32]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[33]  Karsten Schmidt.  Integrating Low Level Symmetries into Reachability Analysis , 2000 .

[34]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

[35]  A. Prasad Sistla,et al.  On-the-Fly Model Checking Under Fairness that Exploits Symmetry , 1999, Formal Methods Syst. Des..

[36]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[37]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[38]  K. Varpaaniemi,et al.  On the Stubborn Set Method in Reduced State Space Generation , 1998 .

[39]  Andreas Blass,et al.  Equivalence Relations, Invariants, and Normal Forms , 1983, SIAM J. Comput..

[40]  L. Babai.  Automorphism groups, isomorphism, reconstruction , 1996 .

[41]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[42]  A. Prasad Sistla.  Symmetry Reductions in Model-Checking , 2003, VMCAI.

[43]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[44]  Karsten Wolf.  How to calculate symmetries of Petri nets , 2000, Acta Informatica.

[45]  Eugene M. Luks,et al.  Permutation Groups and Polynomial-Time Computation , 1996, Groups And Computation.

[46]  Jacobo Torán,et al.  The graph isomorphism problem , 2020, Commun. ACM.

[47]  P. Simons.  Towards Constraint Satisfaction through Logic Programs and the Stable Model Semantics , 1997 .