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

Modeling sequential resource allocation systems using Extended Finite Automata

Zhennan Fei (Institutionen för signaler och system, Automation) ; Sajed Miremadi (Institutionen för signaler och system, Automation) ; Knut Åkesson (Institutionen för signaler och system, Automation)
2011 IEEE Conference on Automation Science and Engineering (CASE) (2161-8070). p. 444 - 449 . (2011)
[Konferensbidrag, refereegranskat]

Deadlock avoidance for resource allocation systems (RAS) is a well-established problem in the Discrete Event System (DES) literature. This paper is mainly concerned with modeling the class of Conjunctive / Disjunctive sequential resource allocation systems (C/D RAS) as finite automata extended with variables. The proposed modeling approach allows for modeling multiple instance execution, routing flexibility and failure handling. With an appropriate model of the system, a symbolic approach is then used to synthesize the optimal supervisor, in the least restrictive sense. Furthermore, a set of compact logical formulae can be extracted and attached to the original model, which results in a modular and comprehensible representation of the supervisor.

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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-10-22. Senast ändrad 2015-01-16.
CPL Pubid: 147605


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 (2005-2017)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

On Symbolic Analysis of Discrete Event Systems Modeled as Automata with Variables