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] Transformations of timed cooperating automata
    Lanotte, R
    Maggiolo-Schettini, A
    Tini, S
    Peron, A
    FUNDAMENTA INFORMATICAE, 2001, 47 (3-4) : 271 - 282
  • [42] On the Distance Between Timed Automata
    Rosenmann, Amnon
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2019), 2019, 11750 : 199 - 215
  • [43] Better Abstractions for Timed Automata
    Herbreteau, Frederic
    Srivathsan, B.
    Walukiewicz, Igor
    2012 27TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2012, : 375 - 384
  • [44] Dynamical properties of timed automata
    Puri, A
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2000, 10 (1-2): : 87 - 113
  • [45] Dynamical properties of timed automata
    Puri, A
    FORMAL TECHNIQUES IN REAL-TIME AND FAULT-TOLERANT SYSTEMS, 1998, 1486 : 210 - 227
  • [46] From Scenarios to Timed Automata
    Saeedloei, Neda
    Kluzniak, Feliks
    FORMAL METHODS: FOUNDATIONS AND APPLICATIONS, SBMF 2017, 2017, 10623 : 33 - 51
  • [47] DETERMINISABILITY OF REGISTER AND TIMED AUTOMATA
    Clemente, Lorenzo
    Lasota, Slawomir
    Piorkowski, Radoslaw
    LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 18 (02) : 1 - 9
  • [48] Dynamical Properties of Timed Automata
    Anuj Puri
    Discrete Event Dynamic Systems, 2000, 10 : 87 - 113
  • [49] Behavioral Cartography of Timed Automata
    Andre, Etienne
    Fribourg, Laurent
    REACHABILITY PROBLEMS, 2010, 6227 : 76 - +
  • [50] A Model Interpreter for Timed Automata
    Iftikhar, M. Usman
    Lundberg, Jonas
    Weyns, Danny
    LEVERAGING APPLICATIONS OF FORMAL METHODS, VERIFICATION AND VALIDATION: FOUNDATIONAL TECHNIQUES, PT I, 2016, 9952 : 243 - 258