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), Comparison of the Expressiveness of Timed Automata and Time Petri Nets, dans Pettersson, Paul; Yi, Wang, Formal Modeling and Analysis of Timed Systems. Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005. Proceedings, Springer : Berlin, p. 211-225. http://dx.doi.org/10.1007/11603009_17

Voir/Ouvrir
Type
Communication / Conférence
Date
2005
Titre du colloque
FORMATS'05 Third International Conference on Formal Modelling and Analysis of Timed Systems
Date du colloque
2005-09
Ville du colloque
Uppsala
Pays du colloque
Suède
Titre de l'ouvrage
Formal Modeling and Analysis of Timed Systems. Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005. Proceedings
Auteurs de l’ouvrage
Pettersson, Paul; Yi, Wang
Éditeur
Springer
Titre de la collection
Lecture Notes in Computer Science
Numéro dans la collection
3829
Ville d’édition
Berlin
Isbn
978-3-540-30946-8
Nombre de pages
305
Pages
211-225
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Roux, Olivier-Henri
Bérard, Béatrice
Cassez, Franck
Haddad, Serge
Lime, Didier
Résumé (EN)
In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur & Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity.
Mots-clés
Expressiveness; Timed Automata; Time Petri Nets; Timed Bisimilarity; Timed Language