Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata

DOI10.1007/978-3-642-04368-0_13zbMath1262.68090OpenAlexW1576756623MaRDI QIDQ3648829

Mani Swaminathan, Martin Fränzle

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

Unnamed Item ⋮ Multi-weighted automata and MSO logic ⋮ Costs and rewards in priced timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• A calculus of durations
• What's decidable about hybrid automata?
• A theory of timed automata
• On the optimal reachability problem of weighted timed automata
• Optimal reachability for multi-priced timed automata
• Optimal infinite scheduling for multi-priced timed automata
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Formal Modeling and Analysis of Timed Systems
• Deciding an Interval Logic with Accumulated Durations

This page was built for publication: Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata