Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions
Aus International Center for Computational Logic
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions
Jan KomendaJan Komenda, Tomáš MasopustTomáš Masopust, Jan H. van SchuppenJan H. van Schuppen
Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions
Technical Report, arXiv.org, volume CoRR abs/1403.4762, March 2014
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions
Technical Report, arXiv.org, volume CoRR abs/1403.4762, March 2014
- KurzfassungAbstract
In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observation. A new weaker sufficient condition for the computation of the supremal conditionally controllable sublanguage is presented. This result is then used for the computation of the supremal conditionally controllable and conditionally normal sublanguage. The paper further generalizes the previous study by considering general, non-prefix-closed languages. - Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@techreport{KMS2014,
author = {Jan Komenda and Tom{\'{a}}{\v{s}} Masopust and Jan H. van
Schuppen},
title = {Maximally Permissive Coordination Supervisory Control - Towards
Necessary and Sufficient Conditions},
institution = {arXiv.org},
year = {2014},
month = {March}
}