Work

The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces

Year: 2011

Type: article

Abstract: In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety requirements but also achieves a certain time optimal performance such as maximum throughput. In this paper, we first present a minimum-makespan supervisor synthesis problem. Then we show that the problem can be solved by a terminable algorithm, where the execution time of each string is computable by the theory of heaps-of-pieces. We also provide a timed supervisory control map that can implement the synthesized minimum-makespan sublanguage.

Source: IEEE Transactions on Automatic Control

DOI: 10.1109/tac.2011.2157391

Authors: Rong Su, J. H. van Schuppen, J. E. Rooda

Institutions: Nanyang Technological University, Centrum Wiskunde & Informatica, Eindhoven University of Technology

Language: English

Topic: Petri Nets in System Modeling

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1585340095

FWCI: 1.397

Cites: 17

Cited by: 15

Related to: 10