Theoretical Computer Science
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Decidable Controller Synthesis for Classes of Linear Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Computing Accumulated Delays in Real-time Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Controllers for reachability specifications for hybrid systems
Automatica (Journal of IFAC)
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Job-Shop Scheduling Using Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
On using priced timed automata to achieve optimal scheduling
Formal Methods in System Design
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Concavely-Priced Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
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
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
REMES tool-chain: a set of integrated tools for behavioral modeling and analysis of embedded systems
Proceedings of the IEEE/ACM international conference on Automated software engineering
Symbolic and compositional reachability for timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
A novel SAT-based approach to the task graph cost-optimal scheduling problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Modeling and reasoning about service behaviors and their compositions
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
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
Relating average and discounted costs for quantitative analysis of timed systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Statistical model checking for networks of priced timed automata
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Specifications for decidable hybrid games
Theoretical Computer Science
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
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Reachability problems on extended o-minimal hybrid automata
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Verification, performance analysis and controller synthesis for real-time systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Optimal conditional reachability for multi-priced timed automata
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Timed temporal logics for abstracting transient states
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Optimal scheduling for constant-rate multi-mode systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Nash equilibrium in weighted concurrent timed games with reachability objectives
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Monitor-Based statistical model checking for weighted metric temporal logic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Model checking inconsistency recovery costs
ICSOC'11 Proceedings of the 2011 international conference on Service-Oriented Computing
Statistical model checking, refinement checking, optimization, … for stochastic hybrid systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Frequencies in forgetful timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Checking correctness of services modeled as priced timed automata
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
A faster algorithm for solving one-clock priced timed games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Reachability Analysis of Cost-Reward Timed Automata for Energy Efficiency Scheduling
Proceedings of Programming Models and Applications on Multicores and Manycores
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
| Hi-index | 0.02 |
We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortest-path problem for a finite directed graph. The directed graph we construct is a refinement of the region automaton due to Alur and Dill. We present an exponential time algorithm to solve the shortest-path problem for weighted timed automata starting from a single state, and a doubly-exponential time algorithm to solve this problem starting from a zone of the state space.