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 条
  • [1] Comparison of the expressiveness of timed automata and time Petri nets
    Bérard, B
    Cassez, F
    Haddad, S
    Lime, D
    Roux, OH
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2005, 3829 : 211 - 225
  • [2] Translations from time Petri nets to timed automata
    Xia, Chuanliang
    PROCEEDINGS OF THE 2009 2ND INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS, VOLS 1-4, 2009, : 2293 - 2297
  • [3] When are Timed Automata weakly timed bisimilar to Time Petri Nets?
    Berard, B.
    Cassez, F.
    Haddad, S.
    Lime, D.
    Roux, O. H.
    THEORETICAL COMPUTER SCIENCE, 2008, 403 (2-3) : 202 - 220
  • [4] When are timed automata weakly timed bisimilar to time Petri nets?
    Bérard, B
    Cassez, R
    Haddad, S
    Lime, D
    Roux, OH
    FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 273 - 284
  • [5] Structural Translation from Time Petri Nets to Timed Automata
    Cassez, Franck
    Roux, Olivier-H.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 128 (06) : 145 - 160
  • [6] From Time Petri Nets to Timed Automata: An untimed approach
    D'Aprile, Davide
    Donatelli, Susanna
    Sangnier, Arnaud
    Sproston, Jeremy
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2007, 4424 : 216 - +
  • [7] Structural translation from Time Petri Nets to Timed Automata
    Cassez, Franck
    Roux, Olivier H.
    JOURNAL OF SYSTEMS AND SOFTWARE, 2006, 79 (10) : 1456 - 1468
  • [8] Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
    Srba, Jiri
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2008, 5215 : 15 - 32
  • [9] Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
    Bouyer, Patricia
    Haddad, Serge
    Reynier, Pierre-Alain
    AUTOMATA, LANGAGES AND PROGRAMMING, PT 2, 2006, 4052 : 420 - 431
  • [10] Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
    Bouyer, Patricia
    Haddad, Serge
    Reynier, Pierre-Alain
    INFORMATION AND COMPUTATION, 2008, 206 (01) : 73 - 107
12345