Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences

DOI10.1007/11787006_36zbMath1133.68383OpenAlexW1484772198MaRDI QIDQ3591404

Pierre-Alain Reynier, Patricia Bouyer, Serge Haddad

Publication date: 11 September 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.6483

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Semantic domains of timed event structures ⋮ On the composition of time Petri nets ⋮ Universal safety for timed Petri nets is PSPACE-complete ⋮ When are timed automata weakly timed bisimilar to time Petri nets? ⋮ Timed Petri nets and timed automata: On the discriminating power of Zeno sequences ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ Time Recursive Petri Nets

This page was built for publication: Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences