Improved undecidability results on weighted timed automata

DOI10.1016/j.ipl.2006.01.012zbMath1187.68291OpenAlexW2081128931MaRDI QIDQ844195

Nicolas Markey, Thomas Brihaye, Patricia Bouyer

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.012

zbMATH Keywords

real-time systemsweighted timed automataweighted timed games

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

Expected reachability-time games ⋮ Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ Model Checking Real-Time Systems ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ Optimal controller synthesis for timed systems ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Weighted o-minimal hybrid systems ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Model checking weighted integer reset timed automata ⋮ MSO logics for weighted timed automata ⋮ Unnamed Item ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Weighted Timed MSO Logics ⋮ Symbolic Approximation of Weighted Timed Games ⋮ Model-checking Timed Temporal Logics ⋮ On the Supports of Recognizable Timed Series ⋮ Keeping Secrets in Resource Aware Components

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• A theory of timed automata
• Updatable timed automata
• On model-checking timed automata with stopwatch observers
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Improved undecidability results on weighted timed automata