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 条
  • [1] SetExp: a method of transformation of timed automata into finite state automata
    Lucien Ouedraogo
    Ahmed Khoumsi
    Mustapha Nourelfath
    Real-Time Systems, 2010, 46 : 189 - 250
  • [2] STATE - a SystemC to Timed Automata Transformation Engine
    Herber, Paula
    Pockrandt, Marcel
    Glesner, Sabine
    2015 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2015 IEEE 7TH INTERNATIONAL SYMPOSIUM ON CYBERSPACE SAFETY AND SECURITY, AND 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON EMBEDDED SOFTWARE AND SYSTEMS (ICESS), 2015, : 1074 - 1077
  • [3] Finite automata on timed ω-trees
    La Torre, S
    Napoli, M
    THEORETICAL COMPUTER SCIENCE, 2003, 293 (03) : 479 - 505
  • [4] Timed Automata Verification and Synthesis via Finite Automata Learning
    Sankur, Ocan
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2023, 2023, 13994 : 329 - 349
  • [5] An Improved Method to Reduce the State Space of the Timed Automata
    Tan, Juan
    Zhou, Yonghua
    Han, Wei
    2011 AASRI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND INDUSTRY APPLICATION (AASRI-AIIA 2011), VOL 2, 2011, : 148 - 151
  • [6] Constructing finite automata with invertibility by transformation method
    Renji Tao
    Shihua Chen
    Journal of Computer Science and Technology, 2000, 15 : 10 - 26
  • [7] Constructing finite automata with invertibility by transformation method
    Tao, RJ
    Chen, SH
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2000, 15 (01) : 10 - 26
  • [8] TRANSFORMATION OF STATE DIAGRAMS BY STATE CHARACTERISTIC EQUATIONS OF FINITE AUTOMATA
    UDAGAWA, K
    TANGE, H
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1965, 48 (12): : 48 - &
  • [9] State identification problems for timed automata
    Krichen, M
    Tripakis, S
    TESTING OF COMMUNICATING SYSTEMS, PROCEEDINGS, 2005, 3502 : 175 - 191
  • [10] On the transformation of two-way finite automata to unambiguous finite automata
    Petrov, Semyon
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2023, 295