@inproceedings{fc9562b84ffa4f53bc1303e42d0a4fdf,
title = "Comparison of the expressiveness of timed automata and time Petri nets",
abstract = "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. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A. We then propose a structural translation from TA to (1-safe) TPNs preserving timed language acceptance. Further on, we prove that the previous (slightly extended) translation also preserves weak timed bisimilarity for a syntactical subclass TAsyn(≤, ≥) of TA. For the theory of TPNs, the consequences are: 1) TA, bounded TPNs and 1-safe TPNs are equally expressive w.r.t. timed language acceptance; 2) TA are strictly more expressive than bounded TPNs w.r.t. timed bisimilarity; 3) The subclass TA syn(≤,≥), bounded and 1-safe TPNs {"}{\`a} la Merlin{"} are equally expressive w.r.t. timed bisimilarity.",
keywords = "Expressiveness, Time Petri Nets, Timed Automata, Timed Bisimilarity, Timed Language",
author = "Beatrice B{\'e}rard and Franck Cassez and Serge Haddad and Didier Lime and Roux, {Olivier H.}",
year = "2005",
language = "English",
isbn = "3540309462",
volume = "3829 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "211--225",
booktitle = "Formal Modeling and Analysis of Timed Systems - Third International Conference, FORMATS 2005, Proceedings",
address = "United States",
note = "3rd International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2005 ; Conference date: 26-09-2005 Through 28-09-2005",
}