From Time Petri Nets to Timed Automata: An Untimed Approach

DOI10.1007/978-3-540-71209-1_18zbMath1186.68252OpenAlexW1606006280MaRDI QIDQ5758109

Arnaud Sangnier, Susanna Donatelli, Davide D'Aprile, Jeremy Sproston

Publication date: 3 September 2007

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_18

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 (2)

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency

This page was built for publication: From Time Petri Nets to Timed Automata: An Untimed Approach