Automata, Languages and Programming

DOI10.1007/b99859zbMath1098.68061OpenAlexW2505584480MaRDI QIDQ5466455

P. Madhusudan, Mikhail Bernadsky, Rajeev Alur

Publication date: 24 August 2005

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

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Games of timing (91A55)

Related Items (17)

Expected reachability-time games ⋮ Model Checking Real-Time Systems ⋮ Improved undecidability results on weighted timed automata ⋮ On the optimal reachability problem of weighted timed automata ⋮ 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 ⋮ Unnamed Item ⋮ Weighted o-minimal hybrid systems ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Optimal infinite scheduling for multi-priced timed automata ⋮ Unnamed Item ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Symbolic Approximation of Weighted Timed Games ⋮ Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata ⋮ Timed network games

This page was built for publication: Automata, Languages and Programming