The synthesis of time optimal supervisors by using heaps-of-pieces

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....

Full description

Saved in:

Bibliographic Details
Main Authors:	Su, Rong., van Schuppen, J. H., Rooda, J. E.
Other Authors:	School of Electrical and Electronic Engineering
Format:	Article
Language:	English
Published:	2013
Subjects:	DRNTU::Engineering::Electrical and electronic engineering
Online Access:	https://hdl.handle.net/10356/95735 http://hdl.handle.net/10220/11239
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University
Language:	English

id	sg-ntu-dr.10356-95735
record_format	dspace
spelling	sg-ntu-dr.10356-957352020-03-07T14:02:44Z The synthesis of time optimal supervisors by using heaps-of-pieces Su, Rong. van Schuppen, J. H. Rooda, J. E. School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering 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. 2013-07-11T08:25:44Z 2019-12-06T19:20:29Z 2013-07-11T08:25:44Z 2019-12-06T19:20:29Z 2011 2011 Journal Article Su, R., van Schuppen, J. H., & Rooda, J. E. (2012). The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces. IEEE Transactions on Automatic Control, 57(1), 105-118. https://hdl.handle.net/10356/95735 http://hdl.handle.net/10220/11239 10.1109/TAC.2011.2157391 en IEEE transactions on automatic control © 2011 IEEE.
institution	Nanyang Technological University
building	NTU Library
country	Singapore
collection	DR-NTU
language	English
topic	DRNTU::Engineering::Electrical and electronic engineering
spellingShingle	DRNTU::Engineering::Electrical and electronic engineering Su, Rong. van Schuppen, J. H. Rooda, J. E. The synthesis of time optimal supervisors by using heaps-of-pieces
description	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.
author2	School of Electrical and Electronic Engineering
author_facet	School of Electrical and Electronic Engineering Su, Rong. van Schuppen, J. H. Rooda, J. E.
format	Article
author	Su, Rong. van Schuppen, J. H. Rooda, J. E.
author_sort	Su, Rong.
title	The synthesis of time optimal supervisors by using heaps-of-pieces
title_short	The synthesis of time optimal supervisors by using heaps-of-pieces
title_full	The synthesis of time optimal supervisors by using heaps-of-pieces
title_fullStr	The synthesis of time optimal supervisors by using heaps-of-pieces
title_full_unstemmed	The synthesis of time optimal supervisors by using heaps-of-pieces
title_sort	synthesis of time optimal supervisors by using heaps-of-pieces
publishDate	2013
url	https://hdl.handle.net/10356/95735 http://hdl.handle.net/10220/11239
_version_	1681037688548884480

The synthesis of time optimal supervisors by using heaps-of-pieces

Similar Items