Abstractions for nonblocking supervisory control of Extended Finite Automata
Paper i proceeding, 2012

An abstraction method for Extended Finite Automata (EFAs), i.e., finite automata extended with variables, using transition projection is presented in this work. A manufacturing system modeled by EFAs is abstracted into subsystems that embody internal interacting dependencies. Synthesis and verification of subsystems are achieved through their model abstractions rather than their global model. Sufficient conditions are presented to guarantee that supervisors result in maximally permissive and nonblocking control. An examples demonstrate the computational effectiveness and practical usage of the approach.

Observers

Computational modeling

Abstraction

Automata

Computational complexity

Supervisory control

Författare

Mohammad Reza Shoaei

Chalmers, Signaler och system, System- och reglerteknik

Lei Feng

Bengt Lennartson

Chalmers, Signaler och system, System- och reglerteknik

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

6-
978-1-4673-0429-0 (ISBN)

Styrkeområden

Produktion

Ämneskategorier

Reglerteknik

Datavetenskap (datalogi)

DOI

10.1109/CoASE.2012.6386446

ISBN

978-1-4673-0429-0

Mer information

Senast uppdaterat

2023-10-05