Compositional Synthesis of Discrete Event Systems Using Synthesis Abstraction
This paper proposes a general method to synthesize a least restrictive supervisor for a large discrete event system model, consisting of a large number of arbitrary automata representing the plants and speci.cations. A new type of abstraction called synthesis abstraction is introduced and three rules are proposed to calculate an abstraction of a given automaton. Furthermore, a compositional algorithm for synthesizing a supervisor for large-scale systems of composed. nite-state automata is proposed. In the proposed algorithm, the synchronous composition is computed step by step and intermediate results are simpli.ed according to synthesis abstraction. Then a supervisor for the abstracted system is calculated, which in combination with the original system gives the least restrictive, nonblocking, and controllable behaviour.
Sahar Mohajerani Robi Malik Simon Ware Martin Fabian
Department of Signal and System, Chalmers University of Technology, Gothenburg, Sweden Department of Computer Science, University of Waikato, Hamilton, New Zealand
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
1549-1554
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）