Backward symbolic optimal reachability in weighted timed automata

DOI10.1007/978-3-030-57628-8_3OpenAlexW3080407957MaRDI QIDQ1996010

Rémi Parrot, Didier Lime

Publication date: 2 March 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57628-8_3

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Better abstractions for timed automata
• On using priced timed automata to achieve optimal scheduling
• A theory of timed automata
• Optimal reachability in cost time Petri nets
• Uppaal in a nutshell
• The expressive power of time Petri nets
• On the synthesis of discrete controllers for timed systems
• Symbolic Optimal Reachability in Weighted Timed Automata
• Model-checking for real-time systems
• Tools and Algorithms for the Construction and Analysis of Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• State space computation and analysis of Time Petri Nets
• CONCUR 2005 – Concurrency Theory
• Abstract Dependency Graphs and Their Application to Model Checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Backward symbolic optimal reachability in weighted timed automata