When are Timed Automata weakly timed bisimilar to Time Petri Nets ? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

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 $\taminus$ 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 $\taminus$ are $PSPACE$-complete. Furthermore we show that for a TA in $\taminus$ 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.
Fichier principal
Vignette du fichier
petri-nets-fsttcs05.pdf (223.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00368578 , version 1 (17-03-2009)

Identifiers

  • HAL Id : inria-00368578 , version 1

Cite

Béatrice Berard, Franck Cassez, Serge Haddad, Didier Lime, Olivier Henri Roux. When are Timed Automata weakly timed bisimilar to Time Petri Nets ?. 25th Int. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), Dec 2005, Chennai, India. pp.276--284. ⟨inria-00368578⟩
203 View
163 Download

Share

Gmail Facebook X LinkedIn More