Number of the records: 1
On conditional decomposability
- 1.
SYSNO ASEP 0383610 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title On conditional decomposability Author(s) Komenda, Jan (MU-W) RID, SAI, ORCID
Masopust, Tomáš (MU-W) RID, ORCID, SAI
van Schuppen, J. H. (NL)Source Title Systems and Control Letters. - : Elsevier - ISSN 0167-6911
Roč. 61, č. 12 (2012), s. 1260-1268Number of pages 9 s. Language eng - English Country NL - Netherlands Keywords discrete-event system ; coordination control ; conditional decomposability Subject RIV BA - General Mathematics R&D Projects GPP202/11/P028 GA ČR - Czech Science Foundation (CSF) GAP103/11/0517 GA ČR - Czech Science Foundation (CSF) Institutional support MU-W - RVO:67985840 UT WOS 000312510000021 EID SCOPUS 84868703208 DOI 10.1016/j.sysconle.2012.07.013 Annotation 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 the 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 is also discussed in this paper in the general settings. It is shown that conditional decomposability is a weaker condition than nonblockingness. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2013
Number of the records: 1