Automated Code Generation for DES Controllers Modeled as Finite State Machines

被引:0
|
作者
Possato, Tiago [1 ,2 ]
Valentini, Joao H. [1 ]
Southier, Luiz F. P. [1 ]
Teixeira, Marcelo [1 ]
机构
[1] UTFPR, Fed Univ Technol Parana, Pato Branco, Brazil
[2] IFC, Catarinense Fed Inst, Videira, Brazil
关键词
Formal modeling; Model conversion; Code generation; SUPERVISORY CONTROL; IMPLEMENTATION;
D O I
10.1007/978-3-031-49342-3_7
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Finite State Machines (FSMs) are the foundation to design Discrete Event Systems (DESs). A FSM that designs a DES model can be further processed using Supervisory Control Theory (SCT) to synthesize correct-by-construction software. When applied to industrial-scale DESs, FSMs face limitations in the design, synthesis, and implementation steps. Supremica is a straightforward tool that facilitates design and synthesis but does not reach the implementation phase. This requires additional tools to convert FSM models into code. This paper presents the tool DEScMaker, which receives as input an FSM model outputting from Supremica and converts it into implementable C code. Our approach complements Supremica with code generation and allows taking advantage of its intuitive interface, useful simulator, and safe algorithms while automating a task that, in practice, consists of complex manual programming. An example illustrates the tool and quantifies its advantages.
引用
收藏
页码:113 / 130
页数:18
相关论文
共 50 条
  • [21] Bounded finite state controllers
    Poupart, P
    Boutiller, C
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16, 2004, 16 : 823 - 830
  • [22] Finite state machines
    Carter, J
    POWER ENGINEERING JOURNAL, 2001, 15 (01): : 15 - 15
  • [23] Finite state machines
    Jonsson, B
    MODEL-BASED TESTING OF REACTIVE SYSTEMS, 2005, 3472 : 611 - 614
  • [24] Optimizations for Quadrature Representations of Finite Element Tensors through Automated Code Generation
    Olgaard, Kristian B.
    Wells, Garth N.
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2010, 37 (01):
  • [25] An automated framework for verifying or refuting trace properties of extended finite state machines
    Taylor, Ramsay G.
    Foster, Michael
    North, Siobhan
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2022, 24 (06) : 949 - 972
  • [26] An automated framework for verifying or refuting trace properties of extended finite state machines
    Ramsay G. Taylor
    Michael Foster
    Siobhán North
    International Journal on Software Tools for Technology Transfer, 2022, 24 : 949 - 972
  • [27] Test suite generation techniques based on extended finite state machines
    Liang, Xiao-Ya
    Xiao, De-Bao
    Zhongshan Daxue Xuebao/Acta Scientiarum Natralium Universitatis Sunyatseni, 2006, 45 (SUPPL.): : 240 - 242
  • [28] A Hybrid Test Generation Approach based on Extended Finite State Machines
    Turlea, Ana
    Ipate, Florentin
    Lefticaru, Raluca
    PROCEEDINGS OF 2016 18TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC), 2016, : 173 - 180
  • [29] Input sequence generation for testing of Communicating Finite State Machines (CFSMs)
    Derderian, Karnig
    Hierons, Robert M.
    Harman, Mark
    Guo, Qiang
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3103 : 1429 - 1430
  • [30] Input sequence generation for testing of Communicating Finite State Machines (CFSMs)
    Derderian, K
    Hierons, RM
    Harman, M
    Guo, Q
    GENETIC AND EVOLUTIONARY COMPUTATION GECCO 2004 , PT 2, PROCEEDINGS, 2004, 3103 : 1429 - 1430