Optimal reachability for multi-priced timed automata

DOI10.1016/J.TCS.2007.09.021zbMath1134.68029OpenAlexW2029795923MaRDI QIDQ2474054

Jacob Illum Rasmussen, Kim Guldstrand Larsen

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.021

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Model Checking Real-Time Systems ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Unnamed Item ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Costs and rewards in priced timed automata ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata ⋮ On the Supports of Recognizable Timed Series ⋮ Model checking for performability

Uses Software

• Kronos
• HyTech
• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• HyTech: A model checker for hybrid systems
• Uppaal in a nutshell
• Algorithms for the Multi-constrained Routing Problem
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Foundations of Software Science and Computational Structures
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Optimal reachability for multi-priced timed automata