Abstractions for nonblocking supervisory control of Extended Finite Automata
Paper in proceedings, 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

Author

Mohammad Reza Shoaei

Chalmers, Signals and Systems, Systems and control, Automation

Lei Feng

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

2012 IEEE International Conference on Automation Science and Engineering: Green Automation Toward a Sustainable Society, CASE 2012, Seoul, 20-24 August 2012

2161-8070 (ISSN)

6-

Areas of Advance

Production

Subject Categories

Control Engineering

Computer Science

DOI

10.1109/CoASE.2012.6386446

ISBN

978-1-4673-0429-0

More information

Created

10/6/2017