Backward symbolic optimal reachability in weighted timed automata

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

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

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

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)