arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.1733eess.SYcs.FLcs.SY
收藏

关于条件可分解性

On Conditional Decomposability

Institute of Mathematics, Academy of Sciences of the Czech Republic(捷克科学院数学研究所);CWI(荷兰数学与计算机科学研究所以)

Jan Komenda, Tomáš Masopust, Jan H. van Schuppen

AI总结:

本文针对离散事件系统的协调监督控制框架,提出了多项式时间算法来验证语言是否关于给定字母表条件可分解,并扩展公共字母表以实现条件可分解性,同时探讨了条件可分解性与模块化离散事件系统无阻塞性的关系。

摘要:

在离散事件系统的协调监督控制框架中,要求规范语言是条件可分解的。本文提出了一种多项式时间算法,用于验证语言是否关于给定字母表条件可分解。此外,我们还提出了一种多项式时间算法来扩展公共字母表,使得语言变为条件可分解。本文还在一般设置下讨论了条件可分解性与模块化离散事件系统无阻塞性的关系。结果表明,条件可分解性比无阻塞性更弱。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑