• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Timed Petri nets and timed automata: On the discriminating power of zeno sequences

Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2008), Timed Petri nets and timed automata: On the discriminating power of zeno sequences, Information and Computation, 206, 1, p. 73-107. http://dx.doi.org/10.1016/j.ic.2007.10.004

View/Open
BHR-icalp06.pdf (118.2Kb)
Type
Article accepté pour publication ou publié
Date
2008
Journal name
Information and Computation
Volume
206
Number
1
Publisher
Elsevier
Pages
73-107
Publication identifier
http://dx.doi.org/10.1016/j.ic.2007.10.004
Metadata
Show full item record
Author(s)
Bouyer, Patricia cc
Haddad, Serge
Reynier, Pierre-Alain
Abstract (EN)
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. We study in this paper their relationship, and prove in particular that they are incomparable with respect to language equivalence. In fact, we study the more general model of timed Petri nets with read-arcs (RA-TdPN), already introduced in [J. Srba, Timed-arc petri nets vs. networks of automata, in: Proceedings of the 26th International Conference Application and Theory of Petri Nets (ICATPN 05), Lecture Notes in Computer Science, vol. 3536, Springer, Berlin, 2005, pp. 385–402], which unifies both models of timed Petri nets and of timed automata, and prove that the coverability problem remains decidable for this model. Then, we establish numerous expressiveness results and prove that Zeno behaviours discriminate between several sub-classes of RA-TdPNs. This has surprising consequences on timed automata, for instance, on the power of non-deterministic clock resets.
Subjects / Keywords
Timed automata; Timed petri nets; Expressiveness

Related items

Showing items related by title and author.

  • Thumbnail
    Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences 
    Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
  • Thumbnail
    Extended Timed Automata and Time Petri Nets 
    Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
  • Thumbnail
    Timed Unfoldings for Networks of Timed Automata 
    Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006) Communication / Conférence
  • Thumbnail
    Comparison of the Expressiveness of Timed Automata and Time Petri Nets 
    Roux, Olivier-Henri; Bérard, Béatrice; Cassez, Franck; Haddad, Serge; Lime, Didier (2005) Communication / Conférence
  • Thumbnail
    On the Computational Power of Timed Differentiable Petri Nets 
    Haddad, Serge; Recalde, Laura; Silva, Manuel (2006) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo