Modeling sequential resource allocation systems using Extended Finite Automata
Paper in proceeding, 2011

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.


Zhennan Fei

Chalmers, Signals and Systems, Systems and control

Sajed Miremadi

Chalmers, Signals and Systems, Systems and control

Knut Åkesson

Chalmers, Signals and Systems, Systems and control

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

444 - 449 6042469
978-1-4577-1731-4 (ISBN)

Subject Categories

Production Engineering, Human Work Science and Ergonomics

Control Engineering

Areas of Advance






More information