Petri nets: an introduction
Journal of the ACM (JACM) - The MIT Press scientific computation series
A multiparameter analysis of the boundedness problem for vector addition systems
Journal of Computer and System Sciences
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Decidability of bisimilarity for one-counter processes
Information and Computation
Well-structured transition systems everywhere!
Theoretical Computer Science
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Simulation and Bisimulation over One-Counter Processes
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Simulation Is Decidable for One-Counter Nets (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Monotonic and Downward Closed Games*
Journal of Logic and Computation
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
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
Church synthesis problem for noisy input
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Efficient controller synthesis for consumption games with multiple resource types
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Concurrent games on VASS with inhibition
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
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
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Solving parity games on integer vectors
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
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
Hi-index | 0.00 |
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding thewinner in such games in undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configurations.