.png){kind=icon}
.png){kind=icon}
Return
Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2013.2248255.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a method for compositional verification of the standard and generalized 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 generalized nonblocking equivalence, which are shown to be correct and computationally feasible. Experimental results demonstrate the suitability of the method to verify several large-scale discrete event systems models both for standard and generalized nonblocking.
Keywords:
Automata
discrete event systems
nonblocking
model/controller reduction
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W