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
相关论文
共 47 条
[1]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[2]  
Alur R., 1999, Computer Aided Verification. 11th International Conference, CAV'99. Proceedings (Lecture Notes in Computer Science Vol.1633), P8
[3]  
ALUR R, 1992, LECT NOTES COMPUT SC, V600, P74, DOI 10.1007/BFb0031988
[4]  
ALUR R, 1992, LECT NOTES COMPUT SC, V630, P340
[5]  
Asarin E, 1998, SYSTEM STRUCTURE AND CONTROL 1998 (SSC'98), VOLS 1 AND 2, P447
[6]  
Behrmann G, 2004, LECT NOTES COMPUT SC, V3185, P200
[7]  
Behrmann G, 2004, LECT NOTES COMPUT SC, V2988, P312
[8]   Timed automata: Semantics, algorithms and tools [J].
Bengtsson, J ;
Yi, W .
LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 :87-124
[9]   SUPERVISORY CONTROL OF TIMED DISCRETE-EVENT SYSTEMS [J].
BRANDIN, BA ;
WONHAM, WM .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (02) :329-342
[10]  
Carroll J., 1989, THEORY FINITE AUTOMA