Theoretical Computer Science
The complexity of mean payoff games on graphs
Theoretical Computer Science
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Preemptive Job-Shop Scheduling Using Stopwatch Automata
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Optimal-Reachability and Control for Acyclic Weighted Timed Automata
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Scheduling a Steel Plant with Timed Automata
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Faster maximum and minimum mean cycle algorithms for system-performance analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Concavely-Priced Timed Automata
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Concavely-Priced Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
An optimized MAC layer to physical device mapping methodology
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Formalising scheduling theories in duration calculus
Nordic Journal of Computing
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Strategic executions of choreographed timed normative multi-agent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
Emptiness and universality problems in timed automata with positive frequency
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Almost optimal strategies in one clock priced timed games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
The refinement of choreographed multi-agent systems
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Frequencies in forgetful timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
A Novel Formalism for Partially Defined Asynchronous Feedback Digital Circuits
Journal of Electronic Testing: Theory and Applications
Model checking for probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.02 |
This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules.