Bridging the gap between Timed Automata and bounded Time Petri Nets

被引:0
|
作者
Berthomieu, Bernard [1 ]
Peres, Florent [1 ]
Vernadat, Francois [1 ]
机构
[1] CNRS, LAAS, F-31077 Toulouse, France
来源
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS | 2006年 / 4202卷
关键词
Time Petri nets; priorities; Timed Automata; weak timed bisimilarity; real-time systems modeling and verification;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Several recent papers investigate the relative expressiveness of Timed Automata and Time Petri Nets, two widespread models for realtime systems. It has been shown notably that Timed Automata and Bounded Time Petri Nets are equally expressive in terms of timed language acceptance, but that Timed Automata are strictly more expressive in terms of weak timed bisimilarity. This paper compares Timed Automata with Bounded Time Petri Nets extended with static Priorities, and shows that two large subsets of these models are equally expressive in terms of weak timed bisimilarity.
引用
收藏
页码:82 / 97
页数:16
相关论文
共 50 条
  • [41] Relaxed Unfolding for Time Petri Nets
    Velez Benito, Franck Carlos
    Kunzle, Luis Allan
    2013 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND APPLICATIONS (CSA), 2013, : 833 - 839
  • [42] Verification technique for time Petri nets
    Bonhomme, P
    Berthelot, G
    Aygalinc, P
    Calvez, S
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4278 - 4283
  • [43] Interval analysis of time Petri nets
    Lima, Evangivaldo A.
    Luders, Ricardo
    Kunzle, Luis Allan
    2006 IMACS: MULTICONFERENCE ON COMPUTATIONAL ENGINEERING IN SYSTEMS APPLICATIONS, VOLS 1 AND 2, 2006, : 51 - 58
  • [44] Diagnosabilization of Time Petri net for timed fault
    Coquand, Camille
    Pencole, Yannick
    Subias, Audine
    IFAC PAPERSONLINE, 2023, 56 (02): : 8648 - 8653
  • [45] Translation from Multisingular Hybrid Petri Nets to Multisingular Hybrid Automata
    Motallebi, Hassan
    Azgomi, Mohammad Abdollahi
    FUNDAMENTA INFORMATICAE, 2014, 130 (03) : 275 - 315
  • [46] State class constructions for branching analysis of time Petri nets
    Berthomieu, B
    Vernadat, F
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2003, 2619 : 442 - 457
  • [47] Local time membrane systems and time Petri nets
    Aman, Bogdan
    Battyanyi, Peter
    Ciobanu, Gabriel
    Vaszil, Gyorgy
    THEORETICAL COMPUTER SCIENCE, 2020, 805 : 175 - 192
  • [48] On clock interval automata for a class of distributed timed DESs with time intervals
    Lefebvre, Dimitri
    Komenda, Jan
    IFAC PAPERSONLINE, 2024, 58 (01): : 204 - 209
  • [49] Bounded DBM-based clock state construction for timed automata in Uppaal
    Lehmann, Sascha
    Schupp, Sibylle
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2023, 25 (01) : 19 - 47
  • [50] Covering Steps Graphs of Time Petri Nets
    Boucheneb, Hanifa
    Barkaoui, Kamel
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 239 (0C) : 155 - 165