Optimal infinite scheduling for multi-priced timed automata

DOI10.1007/s10703-007-0043-4zbMath1133.68360OpenAlexW2130136014MaRDI QIDQ2475633

Ed Brinksma, Patricia Bouyer, Kim Guldstrand Larsen

Publication date: 11 March 2008

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-007-0043-4

zbMATH Keywords

Optimal mean-payoffPriced timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35)

Related Items (21)

On stability of discrete-time switched systems ⋮ Weight Assignment Logic ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ Probabilistic timed automata with clock-dependent probabilities ⋮ An impossibility result in automata-theoretic reinforcement learning ⋮ Optimal controller synthesis for timed systems ⋮ Unnamed Item ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Concavely-Priced Timed Automata ⋮ Multi-weighted automata and MSO logic ⋮ Emptiness and Universality Problems in Timed Automata with Positive Frequency ⋮ Model checking for probabilistic timed automata ⋮ Weighted register automata and weighted logic on data words ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Symbolic Approximation of Weighted Timed Games ⋮ Costs and rewards in priced timed automata ⋮ Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata ⋮ On the Supports of Recognizable Timed Series ⋮ Weighted automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

Uses Software

• Uppaal
• JOBSHOP

Cites Work

• A characterization of the minimum cycle mean in a digraph
• A theory of timed automata
• The complexity of mean payoff games on graphs
• Uppaal in a nutshell
• Computing efficient operation schemes for chemical plants in multi-batch mode
• A Computational Study of the Job-Shop Scheduling Problem
• Hybrid Systems: Computation and Control
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal infinite scheduling for multi-priced timed automata