Title
A framework for compositional nonblocking verification of extended finite-state machines
Abstract
This paper presents a framework for compositional nonblocking verification of discrete event systems modelled as extended finite-state machines (EFSM). Previous results are improved to consider general conflict-equivalence based abstractions of EFSMs communicating both via shared variables and events. Performance issues resulting from the conversion of EFSM systems to finite-state machine systems are avoided by operating directly on EFSMs, deferring the unfolding of variables into state machines as long as possible. Several additional methods to abstract EFSMs and remove events are also presented. The proposed algorithm has been implemented in the discrete event systems tool Supremica, and the paper presents experimental results for several large EFSM models that can be verified faster than by previously used methods.
Year
DOI
Venue
2016
10.1007/s10626-015-0217-y
Discrete Event Dynamic Systems
Keywords
Field
DocType
Extended finite-state machines,Model checking,Nonblocking,Compositional verification,Supervisory control theory
Shared variables,Model checking,Supervisory control,Computer science,Supervisory control theory,Extended finite-state machine,Finite-state machine,Distributed computing
Journal
Volume
Issue
ISSN
26
1
0924-6703
Citations 
PageRank 
References 
6
0.50
7
Authors
3
Name
Order
Citations
PageRank
Sahar Mohajerani1375.18
Robi Malik225326.13
Martin Fabian320427.91