Equivalence of Timed State Machines and safe TPN
Résumé
In this article, we show that an important subclass of Timed Automata, called Timed Input Output State Machines (TIOSM) is weackly time equivalent to bounded non-Zeno Time Petri Nets (TPNs) in the sense of Merlin and Farber. We present here an explicit construction for two-way translation between 1-safe TPNs and TIOSMs; in both directions, the power of clock timing is exploited to obtain concise and analyzable models. || Dans cet article, nous montrons qu'une importante sous-classe d'automates temporisés, appelés Timed Input Output State Machines (TIOSM) est faiblement équivalente aux Réseaux de Petri temporels "non-Zeno" (TPN) (Merlin et Farber). Nous présentons ici une