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

被引:24
|
作者
Mohajerani, Sahar [1 ]
Malik, Robi [2 ]
Fabian, Martin [3 ]
机构
[1] Volvo Cars Corp, Vehicle Dynam & Act Safety Ctr, Gothenburg, Sweden
[2] Univ Waikato, Dept Comp Sci, Hamilton, New Zealand
[3] Chalmers, Dept Signals & Syst, Gothenburg, Sweden
基金
中国国家自然科学基金;
关键词
Discrete event systems; Compositional synthesis; Controller constraints and structure; Algorithms and software; Computational issues; DISCRETE-EVENT SYSTEMS;
D O I
10.1016/j.automatica.2016.10.012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:277 / 281
页数:5
相关论文
共 50 条
  • [31] On the synthesis of synchronizable finite state machines with partial scan
    Nara Inst of Science and Technology, Ikoma, Japan
    Syst Comput Jpn, 1 (53-62):
  • [32] Synthesis of Asynchronous State Machines from Synchronous Specifications
    Oliveira, Duarte L.
    Duarte, Gabriel C.
    Batista, Gracieth C.
    Silva, Diego A.
    Romano, Leonardo
    2020 IEEE 11TH LATIN AMERICAN SYMPOSIUM ON CIRCUITS & SYSTEMS (LASCAS), 2020,
  • [33] Synthesis of finite state machines for low power and testability
    Chaudhury, Saurabh
    Chattopadhyay, Santanu
    Rao, J. Srinivasa
    2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 1434 - +
  • [34] On the synthesis of adaptive tests for nondeterministic finite state machines
    M. L. Gromov
    N. V. Evtushenko
    A. V. Kolomeets
    Programming and Computer Software, 2008, 34 : 322 - 329
  • [35] Synthesis of state machines on the basis of programmable array logics
    Soloviev, VV
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1997, (02): : 65 - 74
  • [36] Formal Specification, Verification and Synthesis of Finite State Machines
    Büttner, Wolfram
    IT - Information Technology, 1997, 39 (03): : 15 - 21
  • [37] Compositional synthesis of maximally permissive supervisors using supervision equivalence
    Flordal, Hugo
    Malik, Robi
    Fabian, Martin
    Akesson, Knut
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2007, 17 (04): : 475 - 504
  • [38] Harnessing overgeneralization in the synthesis of state machines from scenarios
    Mousavi, Abdolmajid
    Far, Behrouz H.
    2008 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-4, 2008, : 1054 - 1059
  • [39] Synthesis of finite state machines for implementation with Programmable structures
    Luba, Tadeusz
    Borowik, Grzegorz
    Krasniewski, Andrzej
    INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2009, 55 (02) : 183 - 200
  • [40] AUTOMATIC SYNTHESIS OF STATE MACHINES FROM TRACE DIAGRAMS
    KOSKIMIES, K
    MAKINEN, E
    SOFTWARE-PRACTICE & EXPERIENCE, 1994, 24 (07): : 643 - 658