Modular control of discrete-event systems with coalgebra

J. Komenda; J.H. Schuppen

doi:10.1109/TAC.2007.915164

Modular control of discrete-event systems with coalgebra

J. Komenda, J.H. Schuppen

Mathematics

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

Modular supervisory control of discrete-event systems, where the overall system is a synchronous (parallel) product of subsystems, is considered. The main results of this paper are formulations of sufficient conditions for the compatibility between the synchronous product and various operations stemming from supervisory control as supervised product and supremal controllable sublanguages. These results are generalized to the case of modules with partial observations: e.g., modular computation of supremal normal sublanguages is studied. Coalgebraic techniques based on the coinduction proof principle are used in our main results. Sufficient conditions are derived for modular to equal global control synthesis. An algorithmic procedure for checking the new conditions is proposed and the computational benefit of the modular approach is discussed and illustrated by comparing the time complexity of modular and monolithic computation. © 2008 IEEE.

Original language	English
Pages (from-to)	447-460
Journal	IEEE Transactions on Automatic Control
Volume	53
DOIs	https://doi.org/10.1109/TAC.2007.915164
Publication status	Published - 2008

Bibliographical note

komenda:schuppen:2008:ieeetac

Access to Document

10.1109/TAC.2007.915164

Handle.net

Persistent link

Cite this

@article{ff1147719b634caf968a890bc3a84817,

title = "Modular control of discrete-event systems with coalgebra",

abstract = "Modular supervisory control of discrete-event systems, where the overall system is a synchronous (parallel) product of subsystems, is considered. The main results of this paper are formulations of sufficient conditions for the compatibility between the synchronous product and various operations stemming from supervisory control as supervised product and supremal controllable sublanguages. These results are generalized to the case of modules with partial observations: e.g., modular computation of supremal normal sublanguages is studied. Coalgebraic techniques based on the coinduction proof principle are used in our main results. Sufficient conditions are derived for modular to equal global control synthesis. An algorithmic procedure for checking the new conditions is proposed and the computational benefit of the modular approach is discussed and illustrated by comparing the time complexity of modular and monolithic computation. {\textcopyright} 2008 IEEE.",

author = "J. Komenda and J.H. Schuppen",

note = "komenda:schuppen:2008:ieeetac ",

year = "2008",

doi = "10.1109/TAC.2007.915164",

language = "English",

volume = "53",

pages = "447--460",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Modular control of discrete-event systems with coalgebra

AU - Komenda, J.

AU - Schuppen, J.H.

N1 - komenda:schuppen:2008:ieeetac

PY - 2008

Y1 - 2008

N2 - Modular supervisory control of discrete-event systems, where the overall system is a synchronous (parallel) product of subsystems, is considered. The main results of this paper are formulations of sufficient conditions for the compatibility between the synchronous product and various operations stemming from supervisory control as supervised product and supremal controllable sublanguages. These results are generalized to the case of modules with partial observations: e.g., modular computation of supremal normal sublanguages is studied. Coalgebraic techniques based on the coinduction proof principle are used in our main results. Sufficient conditions are derived for modular to equal global control synthesis. An algorithmic procedure for checking the new conditions is proposed and the computational benefit of the modular approach is discussed and illustrated by comparing the time complexity of modular and monolithic computation. © 2008 IEEE.

AB - Modular supervisory control of discrete-event systems, where the overall system is a synchronous (parallel) product of subsystems, is considered. The main results of this paper are formulations of sufficient conditions for the compatibility between the synchronous product and various operations stemming from supervisory control as supervised product and supremal controllable sublanguages. These results are generalized to the case of modules with partial observations: e.g., modular computation of supremal normal sublanguages is studied. Coalgebraic techniques based on the coinduction proof principle are used in our main results. Sufficient conditions are derived for modular to equal global control synthesis. An algorithmic procedure for checking the new conditions is proposed and the computational benefit of the modular approach is discussed and illustrated by comparing the time complexity of modular and monolithic computation. © 2008 IEEE.

U2 - 10.1109/TAC.2007.915164

DO - 10.1109/TAC.2007.915164

M3 - Article

VL - 53

SP - 447

EP - 460

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

ER -

Modular control of discrete-event systems with coalgebra

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this