Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Journal of the ACM (JACM)
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Improved undecidability results on weighted timed automata
Information Processing Letters
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
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
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
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
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
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Faster algorithms for mean-payoff games
Formal Methods in System Design
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
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 and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th 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
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Synchronous interface theories and time triggered scheduling
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Theoretical Computer Science
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
On the relationship between reachability problems in timed and counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
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
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reachability in two-clock timed automata is PSPACE-Complete
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
Cost preserving bisimulations for probabilistic automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Optimal bounds for multiweighted and parametrised energy games
Theories of Programming and Formal Methods
Lower-bound-constrained runs in weighted timed automata
Performance Evaluation
Z-reachability Problem for Games on 2-dimensional Vector Addition Systems with States is in P
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.02 |
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource (e.g.energy). We ask the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints (e.g.remains between 0 and some given upper-bound). We also consider a game version of the above, where certain transitions may be uncontrollable.