Costs and rewards in priced timed automata

DOI10.4230/LIPICS.ICALP.2018.125MaRDI QIDQ5002811zbMATH OpenFDO

Authors Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell

Publication date 28 July 2021

zbMATH Keywords

Diophantine equationsPareto dominationpriced timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Decidability of theories and sets of sentences (03B25) Diophantine equations in many variables (11D72) Decidability (number-theoretic aspects) (11U05)

Recommendations

• Costs and rewards in priced timed automata
• Revisiting decidability and optimum reachability for multi-priced timed automata
• Optimal reachability for multi-priced timed automata
• Foundations of Software Science and Computational Structures
• Priced timed automata: theory and tools

Cites work

• 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
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Integer vector addition systems with states
• Kleene-Schützenberg and Büchi theorems for weighted timed automata.
• Model Checking One-clock Priced Timed Automata
• On model-checking timed automata with stopwatch observers
• On the integer solutions of quadratic equations
• On the optimal reachability problem of weighted timed automata
• Optimal infinite scheduling for multi-priced timed automata
• Optimal reachability for multi-priced timed automata
• Revisiting decidability and optimum reachability for multi-priced timed automata
• Signed graphs
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Undecidable diophantine equations
• What's decidable about hybrid automata?

Cited in

(6)

• Revisiting decidability and optimum reachability for multi-priced timed automata
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• Monte Carlo tree search for priced timed automata
• Priced timed automata: theory and tools
• Costs and rewards in priced timed automata
• Concavely-Priced Probabilistic Timed Automata

This page was built for publication: Costs and rewards in priced timed automata

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