SetExp: a method of transformation of timed automata into finite state automata

被引:7
|
作者
Ouedraogo, Lucien [1 ]
Khoumsi, Ahmed [1 ]
Nourelfath, Mustapha [2 ]
机构
[1] Univ Sherbrooke, Dept Genie Elect & Genie Informat, Sherbrooke, PQ J1K 2R1, Canada
[2] Univ Laval, Dept Genie Mecan, Quebec City, PQ G1K 7P4, Canada
关键词
Modeling; Discrete event systems; Real-time system; Timed automata; Finite state automata; SUPERVISORY CONTROL; DISCRETE; SYSTEMS;
D O I
10.1007/s11241-010-9103-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Real-time discrete event systems are discrete event systems with timing constraints, and can be modeled by timed automata. The latter are convenient for modeling real-time discrete event systems. However, due to their infinite state space, timed automata are not suitable for studying real-time discrete event systems. On the other hand, finite state automata, as the name suggests, are convenient for modeling and studying non-real time discrete event systems. To take into account the advantages of finite state automata, an approach for studying real-time discrete event systems is to transform, by abstraction, the timed automata modeling them into finite state automata which describe the same behaviors. Then, studies are performed on the finite state automata model by adapting methods designed for non real-time discrete event systems. In this paper, we present a method for transforming timed automata into special finite state automata called Set-Exp automata. The method, called SetExp, models the passing of time as real events in two types: Set events which correspond to resets with programming of clocks, and Exp events which correspond to the expiration of clocks. These events allow to express the timing constraints as events order constraints. SetExp limits the state space explosion problem in comparison to other transformation methods of timed automata, notably when the magnitude of the constants used to express the timing constraints are high. Moreover, SetExp is suitable, for example, in supervisory control and conformance testing of real-time discrete event systems.
引用
收藏
页码:189 / 250
页数:62
相关论文
共 50 条
  • [21] Interrupt Timed Automata
    Berard, Beatrice
    Haddad, Serge
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2009, 5504 : 197 - +
  • [22] Shrinking Timed Automata
    Sankur, Ocan
    Bouyer, Patricia
    Markey, Nicolas
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 90 - 102
  • [23] Axiomatising timed automata
    Huimin Lin
    Wang Yi
    Acta Informatica, 2002, 38 : 277 - 305
  • [24] Alternating timed automata
    Lasota, Slawomir
    Walukiewicz, Igor
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2008, 9 (02)
  • [25] Formalized Timed Automata
    Wimmer, Simon
    INTERACTIVE THEOREM PROVING (ITP 2016), 2016, 9807 : 425 - 440
  • [26] Timed automata and recognizability
    Hermann, P
    INFORMATION PROCESSING LETTERS, 1998, 65 (06) : 313 - 318
  • [27] Timed Automata Patterns
    Dong, Jin Song
    Hao, Ping
    Qin, Shengchao
    Sun, Jun
    Yi, Wang
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2008, 34 (06) : 844 - 859
  • [28] Scheduling with timed automata
    Abdeddaïm, Y
    Asarin, E
    Maler, O
    THEORETICAL COMPUTER SCIENCE, 2006, 354 (02) : 272 - 300
  • [29] State Estimation of Timed Automata Under Partial Observation
    Gao, Chao
    Lefebvre, Dimitri
    Seatzu, Carla
    Li, Zhiwu
    Giua, Alessandro
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2025, 70 (03) : 1981 - 1987
  • [30] Downward pattern refinement for timed automata
    Wehrle, Martin
    Kupferschmid, Sebastian
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2016, 18 (01) : 41 - 56