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 条
  • [41] Minimizable timed automata
    Springintveld, J.
    Vaandrager, F.
    Lecture Notes in Computer Science, 1135
  • [42] Concuffency in timed automata
    Lanotte, R
    Maggiolo-Schettini, A
    Tini, S
    THEORETICAL COMPUTER SCIENCE, 2003, 309 (1-3) : 503 - 527
  • [43] Eventual timed automata
    D'Souza, D
    Mohan, MR
    FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 322 - 334
  • [44] Timed P Automata
    Barbuti, Roberto
    Maggiolo-Schettini, Andrea
    Milazzo, Paolo
    Tesei, Luca
    FUNDAMENTA INFORMATICAE, 2009, 94 (01) : 1 - 19
  • [45] Testing timed automata
    Springintveld, J
    Vaandrager, F
    D'Argenio, PR
    THEORETICAL COMPUTER SCIENCE, 2001, 254 (1-2) : 225 - 257
  • [46] The Timestamp of Timed Automata
    Rosenmann, Amnon
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2019), 2019, 11750 : 181 - 198
  • [47] Alternating timed automata
    Lasota, S
    Walukiewicz, I
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 250 - 265
  • [48] On Simplification of Timed Automata
    Gromov, Maxim
    PROCEEDINGS OF 2016 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), 2016,
  • [49] Recursive Timed Automata
    Trivedi, Ashutosh
    Wojtczak, Dominik
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2010, 6252 : 306 - 324
  • [50] Interrupt Timed Automata
    Berard, Beatrice
    Haddad, Serge
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2009, 5504 : 197 - +