Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowledge-Based Software Architectures: Acquisition, Specification, and Verification
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The dynamic behavior of concurrent systems can be modeled and analyzed using Petri nets. Many approaches have been proposed to analyze the properties of Petri nets. Among them, reachability analysis is a fundamental method for studying the dynamic properties of Petri nets. However, state space explosion has obstructed its applicability for analyzing large-scale systems. This paper presents a new method to attack state space explosion based on the concept of compositional verification. The strength of our method is in preserving the global information of Petri nets and a set of more effective condensation rules especially for tightly coupled modules (subnets). The current version of our method provides an efficient analysis for detecting deadlock states. An extension of our method for detecting reachable markings is also described.