On the expressive power of timed automata and time petri nets
Béatrice Bérard · 2008
This presentation is based on joint work with F. Cassez*, S. Haddad**, D. Lime* and O. H. Roux* (*IRCCyN, Nantes and **LSV, Cachan), published in the proceedings of ATVA'05, CONCUR'05, FSTTCS'05, with an extended version of the third paper to appear in Theoretical Computer Science. The aim of this work was to compare the expressive power of Timed Automata (TA) and Time Petri Nets (TPN).