Backward symbolic optimal reachability in weighted timed automata

DOI10.1007/978-3-030-57628-8_3MaRDI QIDQ1996010zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 1962849 (Why is no real title available?)
• scientific article; zbMATH DE number 1796156 (Why is no real title available?)
• scientific article; zbMATH DE number 1794360 (Why is no real title available?)
• scientific article; zbMATH DE number 1794367 (Why is no real title available?)
• A theory of timed automata
• Abstract Dependency Graphs and Their Application to Model Checking
• Better abstractions for timed automata
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Model-checking for real-time systems
• On the synthesis of discrete controllers for timed systems
• On using priced timed automata to achieve optimal scheduling
• Optimal reachability in cost time Petri nets
• State space computation and analysis of Time Petri Nets
• Symbolic optimal reachability in weighted timed automata
• The expressive power of time Petri nets
• Tools and Algorithms for the Construction and Analysis of Systems
• Uppaal in a nutshell

Cited in

(1)

• On the optimal reachability problem of weighted timed automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996010)