An algorithm for compositional nonblocking verification of extended finite-state machines
Paper i proceeding, 2014

This paper describes an approach for compositional nonblocking verification of discrete event systems modelled as extended finite-state machines (EFSM). Previous results about finite-state machines in lock-step synchronisation are generalised and applied to EFSMs communicating via shared variables. This gives rise to an EFSM-based conflict check algorithm that composes EFSMs gradually and partially unfolds variables as needed. At each step, components are simplified using conflict-equivalence preserving abstraction. The algorithm has been implemented in the discrete event systems tool Supremica. The paper presents experimental results for the verification of two scalable manufacturing system models, and shows that the EFSM-based algorithm verifies some large models faster than previously used methods.

Nonblocking

Abstraction

Discrete event systems

Compositional verification

Extended finite-state machines

Författare

Sahar Mohajerani

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

R. Malik

University of Waikato

Martin Fabian

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

Advances in the Astronautical Sciences

0065-3438 (ISSN)

Vol. 12 376-382

Styrkeområden

Produktion

Ämneskategorier

Reglerteknik

DOI

10.3182/20140514-3-FR-4046.00039

ISBN

978-3-902823-61-8