### Abstract

In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass T A^{w t b} of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem for T A^{w t b} are P S P A C E-complete. Furthermore we show that for a TA in T A^{w t b} 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.

Original language | English |
---|---|

Pages (from-to) | 202-220 |

Number of pages | 19 |

Journal | Theoretical Computer Science |

Volume | 403 |

Issue number | 2-3 |

DOIs | |

Publication status | Published - 28 Aug 2008 |

Externally published | Yes |

### Keywords

- Time Petri nets
- Timed automata
- Weak timed bisimilarity

## Fingerprint Dive into the research topics of 'When are Timed Automata weakly timed bisimilar to Time Petri Nets?'. Together they form a unique fingerprint.

## Cite this

*Theoretical Computer Science*,

*403*(2-3), 202-220. https://doi.org/10.1016/j.tcs.2008.03.030