Compositional Verification Using Petri Nets

  • Eric Y. T. Juan
  • Jeffrey J. P. Tsai
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 676)


Petri Nets have been widely recognized as a suitable tool for modeling and analyzing concurrent systems [Murata, 1989, Silva, 1989, Yoeli, 1987]. However because of the complexity of state explosion [Lipton, 1987], efficient analysis by reachability graph is restricted to small system models. This section presents a Petri-net based methodology for the compositional verification of state-based properties. State-space reduction is based on three condensation theories, i.e., IOT-failure equivalence, IOT-state equivalence, and firing-dependence theory. To avoid the PSPACE problem, we use heuristic rule-based algorithms. The state space is reduced dynamically after one or more rules succeed. The process of reduction terminates once none of the rules become applicable. The time complexity of some rules is linear. The others are polynomial or can be adjusted to polynomial. Our condensation rules preserve the properties of boundedness, deadlock states, reachable markings, and/or reachable sub-markings.


Boolean Function Parallel Composition Reduction Rule Synchronous Action Reachability Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Eric Y. T. Juan
    • 1
  • Jeffrey J. P. Tsai
    • 2
  1. 1.Department of Information and Computer EngineeringChung Yuan Christian UniversityChung LiTaiwan
  2. 2.Department of Computer ScienceUniversity of Illinois at ChicagoChicagoUSA

Personalised recommendations