Timed-Arc Petri Nets vs. Networks of Timed Automata

Publikation: Konferencebidrag uden forlag/tidsskriftPosterForskning

27 Citationer (Scopus)


We establish mutual translations between the classes of 1-safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled transition systems with time). This provides a convenient characterization from the theoretical point of view but is not always satisfactory from the practical point of view because of the possible non-polynomial blow up in the size (in the direction from automata to nets). Hence we relax the isomorphism requirement and provide efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question. This makes our techniques suitable for automatic translation into a format required by tools like UPPAAL and KRONOS. A direct corollary of the presented reductions is a new PSPACE-completeness result for reachability in 1-safe timed-arc Petri nets, reusing the region/zone techniques already developed for timed automata.
StatusUdgivet - 2005
Begivenhed26th International Conference on Application and Theory of Petri Nets (ICATPN'05) - Miami, USA
Varighed: 20 jun. 200524 jun. 2005
Konferencens nummer: 26


Konference26th International Conference on Application and Theory of Petri Nets (ICATPN'05)

Bibliografisk note

Værtspublikationsredaktører: Gianfranco Ciardo
Værtspublikationsredaktører: Philippe Darondeau
Serie: Lecture Notes in Computer Science, Springer, 3536, 0302-9743
Titel på proceedings: Proceedings of 26th International Conference on Application and Theory of Petri Nets (ICATPN'05)


Dyk ned i forskningsemnerne om 'Timed-Arc Petri Nets vs. Networks of Timed Automata'. Sammen danner de et unikt fingeraftryk.