Symbolic Computation of Nonblocking Control Function for Timed Discrete Event Systems
Paper in proceedings, 2012

In this paper, we symbolically compute a minimally restrictive nonblocking supervisor for timed discrete event systems, in the supervisory control theory context. The method is based on Timed Extended Finite Automata, which is an augmentation of extended finite automata (EFAs) by incorporating discrete time into the model. EFAs are ordinary automaton extended with discrete variables, guard expressions and action functions. To tackle large problems all computations are based on binary decision diagrams (BDDs). The main feature of this approach is that the BDD-based fixed-point computations is not based on “tick” models that have been commonly used in this area, leading to better performance in many cases. As a case study, we effectively computed the minimally restrictive nonblocking supervisor for a well-known production cell.

Author

Sajed Miremadi

Chalmers, Signals and Systems, Systems and control, Automation

Zhennan Fei

Chalmers, Signals and Systems, Systems and control, Automation

Knut Åkesson

Chalmers, Signals and Systems, Systems and control, Automation

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

Proceedings of the IEEE Conference on Decision and Control

01912216 (ISSN)

7352-7359 6426079

Driving Forces

Sustainable development

Areas of Advance

Production

Subject Categories

Control Engineering

DOI

10.1109/CDC.2012.6426079

More information

Created

10/8/2017