Compositional Verification in Supervisory Control
Artikel i vetenskaplig tidskrift, 2009

This paper proposes a compositional approach to verifying whether a large discrete event system is nonblocking. The new approach avoids computing the synchronous product of a large set of finite-state machines. Instead, the synchronous product is computed gradually, and intermediate results are simplified using conflict-preserving abstractions based on process-algebraic results about fair testing. Heuristics are used to choose between different possible abstractions. By translating the problem representation, the same method can also be applied to verify safety properties, in particular, controllability. Experimental results show that the method is applicable to finite-state machine models of industrial scale and brings considerable improvements in performance over other methods for nonblocking verification.

supervisory control

discrete-event systems

model checking

discrete-event systems

nonblocking

Författare

Hugo Flordal

Chalmers, Signaler och system, System- och reglerteknik, Automation

R. Malik

University of Waikato

SIAM Journal on Control and Optimization

0363-0129 (ISSN) 1095-7138 (eISSN)

Vol. 48 3 1914-1938

Ämneskategorier

Reglerteknik

DOI

10.1137/070695526

Mer information

Skapat

2017-10-07