Compositional synthesis of supervisors in the form of state machines and state maps

详细信息    查看全文

• 作者：Sahar Mohajerani^a ; ^{sahar.mohajerani@volvocars.com} ; Robi Malik^b ; ^{robi@waikato.ac.nz} ; Martin Fabian^c ; ^{fabian@chalmers.se}
• 关键词：Discrete event systems ; Compositional synthesis ; Controller constraints and structure ; Algorithms and software ; Computational issues
• 刊名：Automatica
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：76
• 期：Complete
• 页码：277-281
• 全文大小：489 K
• 卷排序：76

文摘

This paper investigates the compositional abstraction-based synthesis of least restrictive, controllable, and nonblocking supervisors for discrete event systems that are given as a large number of finite-state machines. It compares a previous algorithm that synthesises modular supervisors in the form of state machines, with an alternative that records state maps after each abstraction step and uses these to control the system. The state map-based algorithm supports all abstraction methods used previously, and in addition allows for nondeterminism, hiding, and transition removal. It has been implemented in the software tool Supremica and applied to several large industrial models. The experimental results and the complexity analysis show that state maps can be computed efficiently and in many cases require less memory than state machine-based supervisors.