@inproceedings{DBLP:conf/formats/BerardCHLR05,
  author    = {B{\'{e}}atrice B{\'{e}}rard and
               Franck Cassez and
               Serge Haddad and
               Didier Lime and
               Olivier H. Roux},
  title     = {Comparison of the Expressiveness of Timed Automata and Time Petri
               Nets},
  booktitle = {Formal Modeling and Analysis of Timed Systems, Third International
               Conference, {FORMATS} 2005, Uppsala, Sweden, September 26-28, 2005,
               Proceedings},
  pages     = {211--225},
  editor    = {Paul Pettersson and
               Wang Yi},
          Type = {B - International Conferences},

 series    = {Lecture Notes in Computer Science},
  volume    = {3829},
  publisher = {Springer},
  year      = {2005},
  urlpaper = {papers/petri-nets-formats05.pdf},
  urlslides = {papers/slides-formats-05.pdf},
  url_link       = {http://dx.doi.org/10.1007/11603009_17},
  doi       = {10.1007/11603009_17},
  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 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 bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.},
  keywords = {Petri nets, timed automata, expressiveness},
}

{"_id":"MbBeXGFNDRpQNskNo","bibbaseid":"brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005","author_short":["Bérard, B.","Cassez, F.","Haddad, S.","Lime, D.","Roux, O. H."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Béatrice"],"propositions":[],"lastnames":["Bérard"],"suffixes":[]},{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Serge"],"propositions":[],"lastnames":["Haddad"],"suffixes":[]},{"firstnames":["Didier"],"propositions":[],"lastnames":["Lime"],"suffixes":[]},{"firstnames":["Olivier","H."],"propositions":[],"lastnames":["Roux"],"suffixes":[]}],"title":"Comparison of the Expressiveness of Timed Automata and Time Petri Nets","booktitle":"Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings","pages":"211–225","editor":[{"firstnames":["Paul"],"propositions":[],"lastnames":["Pettersson"],"suffixes":[]},{"firstnames":["Wang"],"propositions":[],"lastnames":["Yi"],"suffixes":[]}],"series":"Lecture Notes in Computer Science","volume":"3829","publisher":"Springer","year":"2005","urlpaper":"papers/petri-nets-formats05.pdf","urlslides":"papers/slides-formats-05.pdf","url_link":"http://dx.doi.org/10.1007/11603009_17","doi":"10.1007/11603009_17","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 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 bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.","keywords":"Petri nets, timed automata, expressiveness","bibtex":"@inproceedings{DBLP:conf/formats/BerardCHLR05,\n author = {B{\\'{e}}atrice B{\\'{e}}rard and\n Franck Cassez and\n Serge Haddad and\n Didier Lime and\n Olivier H. Roux},\n title = {Comparison of the Expressiveness of Timed Automata and Time Petri\n Nets},\n booktitle = {Formal Modeling and Analysis of Timed Systems, Third International\n Conference, {FORMATS} 2005, Uppsala, Sweden, September 26-28, 2005,\n Proceedings},\n pages = {211--225},\n editor = {Paul Pettersson and\n Wang Yi},\n Type = {B - International Conferences},\n\n series = {Lecture Notes in Computer Science},\n volume = {3829},\n publisher = {Springer},\n year = {2005},\n urlpaper = {papers/petri-nets-formats05.pdf},\n urlslides = {papers/slides-formats-05.pdf},\n url_link = {http://dx.doi.org/10.1007/11603009_17},\n doi = {10.1007/11603009_17},\n 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 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 bounded and 1-safe TPNs “`a la Merlin” are equally expressive w.r.t. timed bisimilarity.},\n keywords = {Petri nets, timed automata, expressiveness},\n}\n\n","author_short":["Bérard, B.","Cassez, F.","Haddad, S.","Lime, D.","Roux, O. H."],"editor_short":["Pettersson, P.","Yi, W."],"key":"DBLP:conf/formats/BerardCHLR05","id":"DBLP:conf/formats/BerardCHLR05","bibbaseid":"brard-cassez-haddad-lime-roux-comparisonoftheexpressivenessoftimedautomataandtimepetrinets-2005","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/petri-nets-formats05.pdf","Slides":"http://science.mq.edu.au/~fcassez/bib/papers/slides-formats-05.pdf"," link":"http://dx.doi.org/10.1007/11603009_17"},"keyword":["Petri nets","timed automata","expressiveness"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F"],"keywords":["petri nets","timed automata","expressiveness"],"search_terms":["comparison","expressiveness","timed","automata","time","petri","nets","bérard","cassez","haddad","lime","roux"],"title":"Comparison of the Expressiveness of Timed Automata and Time Petri Nets","year":2005}