Integer and combinatorial optimization
Integer and combinatorial optimization
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Information and Computation
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for 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
Computing Accumulated Delays in Real-time Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
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
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
Concavely-Priced Timed Automata
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
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
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
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
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Expected reachability-time games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
MSO logics for weighted timed automata
Formal Methods in System Design
Cost soundness for priced resource-constrained workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Reachability-time games on timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Controllers with minimal observation power (application to timed systems)
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Efficient model-checking of dense-time systems with time-convexity analysis
Theoretical Computer Science
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Safety and Soundness for Priced Resource-Constrained Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as well as a supremum cost. We show that this problem is PSpace-Complete. Our proof uses techniques of linear programming, and thus exploits an important property of optimal runs: their time-transitions use a time τ which is arbitrarily close to an integer. We then propose an extension of the region graph, the weighted discrete graph, whose structure gives light on the way to solve the cost-optimal reachability problem. We also give an application of the cost-optimal reachability problem in the context of timed games.