Modeling sequential resource allocation systems using Extended Finite Automata
Paper i 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.

Författare

Zhennan Fei

Chalmers, Signaler och system, System- och reglerteknik, Automation

Sajed Miremadi

Chalmers, Signaler och system, System- och reglerteknik, Automation

Knut Åkesson

Chalmers, Signaler och system, System- och reglerteknik, Automation

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

444 - 449 6042469

Ämneskategorier

Produktionsteknik, arbetsvetenskap och ergonomi

Reglerteknik

Styrkeområden

Produktion

DOI

10.1109/CASE.2011.6042469

ISBN

978-1-4577-1731-4

Mer information

Skapat

2017-10-07