On conditional decomposability
From International Center for Computational Logic
On conditional decomposability
Jan KomendaJan Komenda, Tomáš MasopustTomáš Masopust, Jan H. van SchuppenJan H. van Schuppen
Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
On conditional decomposability
Systems & Control Letters, 61(12):1260–1268, 2012
On conditional decomposability
Systems & Control Letters, 61(12):1260–1268, 2012
- KurzfassungAbstract
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems in general settings is also discussed in this paper. It is shown that conditional decomposability is a weaker condition than nonblockingness. - Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@article{KMS2012,
author = {Jan Komenda and Tom{\'{a}}{\v{s}} Masopust and Jan H. van Schuppen},
title = {On conditional decomposability},
journal = {Systems \& Control Letters},
volume = {61},
number = {12},
year = {2012},
pages = {1260{\textendash}1268},
doi = {10.1016/j.sysconle.2012.07.013}
}
