arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.01168cs.FL
收藏

标记为分布字母的自由选择网的Kleene定理

Kleene Theorems for Free Choice Nets Labelled with Distributed Alphabets

Ramchandra Phawade

摘要:

我们提供了(PNSE'2014)具有“分布式选择属性”的自由选择网的表达式,这使得网“直积”可表示。在最近的一项工作(PNSE'2016)中,我们给出了通过丢弃分布式选择属性获得的更大类自由选择网的等价语法。在这两个作品中,自由选择网的类别都受到最终标记集上的“乘积条件”的限制。在本文中,我们摆脱了这一限制,并给出相应的“自由选择同步产品和Zielonka自动机”的网的结果类的表达式。对于具有分布选择性质的自由选择网,我们给出了另一种利用多项式时间可检验性质的刻画。我们考虑的自由选择网是1-有界的,S-可覆盖的,并且用分布字母标记,其中相关S-覆盖的S-分量遵守给定的字母分布。

英文摘要:

We provided (PNSE'2014) expressions for free choice nets having "distributed choice property" which makes the nets "direct product" representable. In a recent work (PNSE'2016), we gave equivalent syntax for a larger class of free choice nets obtained by dropping distributed choice property. In both these works, the classes of free choice nets were restricted by a "product condition" on the set of final markings. In this paper we do away with this restriction and give expressions for the resultant classes of nets which correspond to "free choice synchronous products and Zielonka automata". For free choice nets with distributed choice property, we give an alternative characterization using properties checkable in polynomial time. Free choice nets we consider are 1-bounded, S-coverable, and are labelled with distributed alphabets, where S-components of the associated S-cover respect the given alphabet distribution.

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

↑