Compositional verification of concurrent systems using Petri-net-based condensation rules

Abstract

The state-explosion problem of formal verification has obstructed its application to large-scale software systems. In this article, we introduce a set of new condensation theories: IOT-failure equivalence, IOT-state equivalence, and firing-dependence theory to cope with this problem. Our condensation theories are much weaker than current theories used for the compositional verification of Petri nets. More significantly, our new condensation theories can eliminate the interleaved behaviors caused by asynchronously sending actions. Therefore, our technique provides a much more powerful means for the compositional verification of asynchronous processes. Our technique can efficiently analyze several state-based properties: boundedness, reachable markings, reachable submarkings, and deadlock states. Based on the notion of our new theories, we develop a set of condensation rules for efficient verification of large-scale software systems. The experimental results show a significant improvement in the analysis of large-scale concurrent systems.

A method to test concurrent systems using architectural specification

“…The main problem with using RG is the state space explosion that limits its usage. Fortunately, there exist extensive bodies of work dealing with the state explosion amid at large and complex systems [9].…”

Design of Distributed Manufacturing Systems Using UML and Petri Nets

“…The composition is performed using standard Petri net techniques (Juan et al, 1998) and the information in the GDS concerning desirable and undesirable transitions. For example, an almost general rule applicable when we want to prevent a transition t k in Petri Net N j from firing under a certain marking m i k in Petri Net N i , a new place is added and connected as input/output to the transition t k .…”

Verification of a Hybrid Model of a Manufacturing System using Rectangular Petri Nets

“…The principal step in the process of verification involves the generation of Rectangular Reachability Graph, RRG, which is a directed graph with nodes labelled by reachable markings of N. Each edge of RRG is labelled by both a transition and an interval of all feasible time durations of continuous trajectories ending by firing of the transition. Many behavioural properties of conventional Petri nets, including liveness 4 , reversibility, home state (Juan et al (1998)) and concurrency set (Azzopardi and Holding (1997)), can be extended to RPNs. Verification of an RPN can be expressed in terms of liveness properties (things that the system should do) and safety properties (things that the system should not do) where these terms are used in the formal methods sense (Lamport, 1997).…”