On the optimal reachability problem of weighted timed automata

DOI10.1007/s10703-007-0035-4zbMath1129.68039OpenAlexW2056957549MaRDI QIDQ2385195

Jean-François Raskin, Véronique Bruyère, Thomas Brihaye, Patricia Bouyer

Publication date: 11 October 2007

Published in: Formal Methods in System Design (Search for Journal in Brave)

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

zbMATH Keywords

Cost-optimal reachability problemWeighted timed automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (28)

Model measuring for discrete and hybrid systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Optimal controller synthesis for timed systems ⋮ Monte Carlo tree search for priced timed automata ⋮ Unnamed Item ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Unnamed Item ⋮ Weighted o-minimal hybrid systems ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Concavely-Priced Timed Automata ⋮ MSO logics for weighted timed automata ⋮ Component simulation-based substitutivity managing QoS and composition issues ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Minimal Cost Reachability/Coverability in Priced Timed Petri Nets ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Timed automata relaxation for reachability ⋮ Unnamed Item ⋮ Weighted Timed MSO Logics ⋮ Symbolic Approximation of Weighted Timed Games ⋮ Costs and rewards in priced timed automata ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata ⋮ Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata ⋮ On the Supports of Recognizable Timed Series ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Timed network games

Uses Software

• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• A theory of timed automata
• Decidable integration graphs.
• Uppaal in a nutshell
• Hybrid Systems: Computation and Control
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Convex Analysis
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: On the optimal reachability problem of weighted timed automata