CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Abstractions for nonblocking supervisory control of Extended Finite Automata

Mohammad Reza Shoaei (Institutionen för signaler och system, Automation) ; Lei Feng ; Bengt Lennartson (Institutionen för signaler och system, 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). p. 6. (2012)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Automata, Computational complexity, Computational modeling, Abstraction, Observers , Supervisory control

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-01-17. Senast ändrad 2014-09-02.
CPL Pubid: 171117


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Automation


Datavetenskap (datalogi)

Chalmers infrastruktur