@inproceedings{86be581b66ad42ed8d88b6f0de67fc79,
title = "When are timed automata weakly timed bisimilar to time petri nets?",
abstract = "In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass T Awtb of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for T Awtb are PSPACE-complete. Furthermore we show that for a TA in T Awtb with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.",
keywords = "Time Petri Nets, Timed Automata, Weak Timed Bisimilarity",
author = "Beatrice B{\'e}rard and Franck Cassez and Serge Haddad and Didier Lime and Roux, {Olivier H.}",
year = "2005",
language = "English",
isbn = "3540304959",
volume = "3821 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "273--284",
booktitle = "FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science - 25th International Conference, Proceedings",
address = "United States",
note = "25th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005 ; Conference date: 15-12-2005 Through 18-12-2005",
}