Reachability in succinct one-counter games
Logic in Computer Science
2014-07-21 v2
Authors:
Paul Hunter
Abstract
We consider the reachability problem on transition systems corresponding to succinct one-counter machines, that is, machines where the counter is incremented or decremented by a value given in binary.
Keywords
Cite
@article{arxiv.1407.1996,
title = {Reachability in succinct one-counter games},
author = {Paul Hunter},
journal= {arXiv preprint arXiv:1407.1996},
year = {2014}
}
Related papers
View all related →
Computer Science and Game Theory · Computer Science
Reachability Games on Extended Vector Addition Systems with States
Tomas Brazdil, Petr Jancar, Antonin Kucera
2010-02-15
Formal Languages and Automata Theory · Computer Science
On Boundedness Problems for Pushdown Vector Addition Systems
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
2015-07-28
Computer Science and Game Theory · Computer Science
On The Complexity of Counter Reachability Games
Julien Reichert
2013-07-22
Logic in Computer Science · Computer Science
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets
Petr Jancar, Petr Osicka, Zdenek Sawa
2018-01-04
Formal Languages and Automata Theory · Computer Science
Continuous One-Counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt +1
2021-02-04
Logic in Computer Science · Computer Science
Countdown games, and simulation on (succinct) one-counter nets
Petr Jancar, Petr Osicka, Zdenek Sawa
2023-06-22
Statistics Theory · Mathematics
Robust approachability and regret minimization in games with partial monitoring
Shie Mannor, Vianney Perchet, Gilles Stoltz
2012-02-17
Optimization and Control · Mathematics
Approachability with Constraints
Gaëtan Fournier, Eden Kuperwasser, Orin Munk, Eilon Solan +1
2017-12-05
Logic in Computer Science · Computer Science
On Higher-Order Reachability Games vs May Reachability
Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi
2024-09-16
Logic in Computer Science · Computer Science
Reachability Problem for Weak Multi-Pushdown Automata
Wojciech Czerwiński, Piotr Hofman, SŁawomir Lasota
2015-07-01
Formal Languages and Automata Theory · Computer Science
The complexity of bidirected reachability in valence systems
Moses Ganardi, Rupak Majumdar, Georg Zetzsche
2022-06-28
Logic in Computer Science · Computer Science
Vector Addition System Reversible Reachability Problem
Jérôme Leroux
2016-08-11
Logic in Computer Science · Computer Science
Bounded Reachability Problems are Decidable in FIFO Machines
Benedikt Bollig, Alain Finkel, Amrita Suresh
2023-06-22
Formal Languages and Automata Theory · Computer Science
Reachability in symmetric VASS
Łukasz Kamiński, Sławomir Lasota
2026-01-12
Logic in Computer Science · Computer Science
Monus semantics in vector addition systems with states
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
2023-09-14
Computational Complexity · Computer Science
The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops
Marius Bozga, Radu Iosif, Filip Konecny
2016-02-16
Computer Science and Game Theory · Computer Science
Approximating Values of Generalized-Reachability Stochastic Games
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger +1
2021-02-02
Logic in Computer Science · Computer Science
Reachability is Tower Complete
Yuxi Fu, Qizhe Yang
2020-03-24
Formal Languages and Automata Theory · Computer Science
General Decidability Results for Systems with Continuous Counters
A. R. Balasubramanian, Matthew Hague, Rupak Majumdar, Ramanathan S. Thinniyam +1
2025-11-27
Optimization and Control · Mathematics
Attainability in Repeated Games with Vector Payoffs
Dario Bauso, Ehud Lehrer, Eilon Solan, Xavier Venel
2014-03-07
Formal Languages and Automata Theory · Computer Science
Reachability Switching Games
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2023-06-22
Formal Languages and Automata Theory · Computer Science
Invariants for One-Counter Automata with Disequality Tests
Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, Nicolas Waldburger
2024-08-23
Computer Science and Game Theory · Computer Science
Reachability for Branching Concurrent Stochastic Games
Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis
2019-04-25
Formal Languages and Automata Theory · Computer Science
Zero-Reachability in Probabilistic Multi-Counter Automata
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera, Petr Novotný +1
2014-01-28
Logic in Computer Science · Computer Science
Checking Temporal Properties of Presburger Counter Systems using Reachability Analysis
K Vasanta Lakshmi, Aravind Acharya, Raghavan Komondoor
2017-12-18