On the Interval-Bound Problem for Weighted Timed Automata

DOI10.1007/978-3-642-21254-3_36MaRDI QIDQ3004604zbMATH OpenOpenAlexFDO

Authors Karin Quaas

Publication date 3 June 2011

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21254-3_36

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• On the optimal reachability problem of weighted timed automata
• Improved undecidability results on weighted timed automata
• A Kleene-Schützenberger theorem for weighted timed automata
• A Kleene-Schützenberger Theorem for Weighted Timed Automata
• Kleene-Schützenberg and Büchi theorems for weighted timed automata.
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Symbolic optimal reachability in weighted timed automata
• Weighted timed automata: model-checking and games
• Logics for weighted timed pushdown automata

Cited in

(8)

• On the optimal reachability problem of weighted timed automata
• Model-based verification, optimization, synthesis and performance evaluation of real-time systems
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• ^*-continuous Kleene -algebras for energy problems
• An $\omega$-algebra for real-time energy problems
• Energy Büchi problems
• -regular energy problems
• Improved undecidability results on weighted timed automata

This page was built for publication: On the Interval-Bound Problem for Weighted Timed Automata

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