Detecting cycles in dynamic graphs in polynomial time
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A unified approach for deciding the existence of certain Petri net paths
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Optimal paths in weighted timed automata
Theoretical Computer Science - Logic, semantics and theory of programming
Computation: finite and infinite machines
Computation: finite and infinite machines
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
On Yen's Path Logic for Petri Nets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Timed automata with observers under energy constraints
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
RP'10 Proceedings of the 4th international conference on Reachability problems
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
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
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
Synthesis for multi-objective stochastic games: an application to autonomous urban driving
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
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.01 |
Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g. only for behaviours where a resource is always available (nonnegative accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types of multiweighted automata and identify new complexity and (un)decidability results for both one- and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata.