Extended Timed Automata and Time Petri Nets
Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006), Extended Timed Automata and Time Petri Nets, Sixth International Conference on Application of Concurrency to System Design, 2006. ACSD 2006., IEEE Computer Society, p. 91-100. http://dx.doi.org/10.1109/ACSD.2006.6
TypeCommunication / Conférence
Titre du colloqueSixth International Conference on Application of Concurrency to System Design, ACSD 2006
Date du colloque2006-06
Ville du colloqueTurku
Pays du colloqueFinlande
Titre de l'ouvrageSixth International Conference on Application of Concurrency to System Design, 2006. ACSD 2006.
MétadonnéesAfficher la notice complète
Résumé (EN)Timed automata (TA) and time Petri nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability properties and timed languages has been proposed, which does however not extend to larger classes of TA which would allow diagonal constraints or more general resets of clocks. Though these features do not add expressiveness, they yield exponentially more concise models. In this work, we propose two translations: one from extended TA to TPNs whose size is either linear or quadratic in the size of the original TA, depending on the features which are allowed; another one from a parallel composition of TA to TPNs, which is also linear. As a consequence, we get that TPNs are exponentially more concise than TA.
Mots-clésTimed Petri nets; timed automata
Affichage des éléments liés par titre et auteur.