Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions

Robi Malik, Ryan Leduc
2013 IEEE Transactions on Automatic Control  
This paper proposes a method for compositional verification of the standard and generalised nonblocking properties of large discrete event systems. The method is efficient as it avoids the explicit construction of the complete state space by considering and simplifying individual subsystems before they are composed further. Simplification is done using a set of abstraction rules preserving generalised nonblocking equivalence, which are shown to be correct and computationally feasible.
more » ... feasible. Experimental results demonstrate the suitability of the method to verify several large-scale discrete event systems models both for standard and generalised nonblocking.
doi:10.1109/tac.2013.2248255 fatcat:cssi2cya7jhmvjn4bktyybdf2i