The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Information and Computation
Computing Accumulated Delays in Real-time Systems
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
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
On the interval-bound problem for weighted timed automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Efficient controller synthesis for consumption games with multiple resource types
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Cost soundness for priced resource-constrained workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
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
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
Optimal bounds for multiweighted and parametrised energy games
Theories of Programming and Formal Methods
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
Safety and Soundness for Priced Resource-Constrained Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
In this paper we study one-clock priced timed automata in which prices can grow linearly (dp/dt = k) or exponentially (dp/dt = kp), with discontinuous updates on edges. We propose EXPTIME algorithms to decide the existence of controllers that ensure existence of infinite runs or reachability of some goal location with non-negative observer value all along the run. These algorithms consist in computing the optimal delays that should be elapsed in each location along a run, so that the final observer value is maximized (and never goes below zero).