Layered Composition for Timed Automata

被引:0
作者
Olderog, Ernst-Ruediger [1 ]
Swaminathan, Mani [1 ]
机构
[1] Carl von Ossietzky Univ Oldenburg, Dept Comp Sci, D-2900 Oldenburg, Germany
来源
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS | 2010年 / 6246卷
关键词
PARTIAL-ORDER REDUCTION; MODEL-CHECKING;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition independence for TA, and demonstrate the validity of the communication closed layer (CCL) laws in such a setting, by means of an operator for layered composition that is intermediate between parallel and sequential composition. Next, we introduce the principles of input/output (i/o) and partial-order (po) equivalences, and show that such equivalences are preserved when the layered composition operator is replaced by sequential composition within the expressions appearing in the CCL laws. Finally, we proceed to show that such layering (together with equivalences obtained through the CCL laws) can be useful in the design and verification of dense real-time systems that consist of a network of interacting components, by bringing about a reduction of the state-space through the exploitation of transition independence. This is illustrated by considering a collision avoidance protocol developed for an audio/video system of Bang and Olufsen.
引用
收藏
页码:228 / 242
页数:15
相关论文
共 23 条
[1]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[2]  
Alur R, 1997, LECT NOTES COMPUT SC, V1254, P340
[3]  
Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
[4]  
Behrmann G, 2004, LECT NOTES COMPUT SC, V3185, P200
[5]  
Ben Salah R, 2006, LECT NOTES COMPUT SC, V4137, P465
[6]  
Bengtsson J, 1998, LECT NOTES COMPUT SC, V1466, P485, DOI 10.1007/BFb0055643
[7]  
Bouyer P., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P210
[8]  
Bozga M, 1998, LECT NOTES COMPUT SC, V1486, P298, DOI 10.1007/BFb0055357
[9]  
Dams D., 1998, Formal Aspects of Computing, V10, P469, DOI 10.1007/s001650050028
[10]   Timed Automata Patterns [J].
Dong, Jin Song ;
Hao, Ping ;
Qin, Shengchao ;
Sun, Jun ;
Yi, Wang .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2008, 34 (06) :844-859