Verification of Supervisory Control Properties of Finite Automata Extended with Variables
Rapport, 2009

Verification and synthesis of control logic programs using Supervisory Control Theory (SCT) is an important topic. Most SCT methods are based on finite state automata (FA). FA extended with variables (EFA) are a compact, but otherwise equivalent to FA notation, proven to be beneficial in modeling control logic systems. To use existing SCT methods with EFA, it is necessary to convert EFA to FA. In certain cases this conversion can be very time-consuming, even if the number of resulting reachable states is very small compared to the total state-set of the system. In this paper we present a way to do verification of SCT properties of EFA models without converting them to FA. Instead, we convert them to the models for Symbolic Model Verification tool NuSMV. The conversion is performed in polynomial time. Experimental results show that NuSMV effectively utilizes small reachable state-set of the system to do verification.

manufacturing systems

model checking

control logic

formal verification

supervisory control

finite automata

Författare

Alexey Voronov

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

Knut Åkesson

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

Ämneskategorier

Reglerteknik

Datavetenskap (datalogi)

Diskret matematik

R - Department of Signals and Systems, Chalmers University of Technology: 003/2009

Mer information

Skapat

2017-10-07