Reachability in Succinct and Parametric One-Counter Automata
From MaRDI portal
Recommendations
Cites work
- Automated Technology for Verification and Analysis
- DP lower bounds for equivalence-checking and model-checking of one-counter automata
- Flat Parametric Counter Automata
- scientific article; zbMATH DE number 1670834 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1223619 (Why is no real title available?)
- scientific article; zbMATH DE number 1304996 (Why is no real title available?)
- scientific article; zbMATH DE number 2038746 (Why is no real title available?)
- On the solvability of a class of Diophantine equations and applications
- On two-way FA with monotonic counters and quadratic Diophantine equations
- Parametric real-time reasoning
- Programs with Lists Are Counter Automata
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Term Rewriting and Applications
- The Diophantine Problem for Addition and Divisibility
- The effects of bounding syntactic resources on Presburger LTL
Cited in
(52)- One-counter automata for parsing and language approximation
- Reachability in succinct one-counter games
- Synthesis problems for one-counter automata
- Tight bounds for reachability problems on one-counter and pushdown systems
- Computing linear arithmetic representation of reachability relation of one-counter automata
- Taming past LTL and flat counter systems
- Reachability in two-clock timed automata is PSPACE-complete
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Context-free commutative grammars with integer counters and resets
- Bisimulation equivalence and regularity for real-time one-counter automata
- Reachability games with relaxed energy constraints
- Branching-time model checking of parametric one-counter automata
- Dynamic complexity of the Dyck reachability
- Model checking succinct and parametric one-counter automata
- scientific article; zbMATH DE number 1500528 (Why is no real title available?)
- Model checking flat Freeze LTL on one-counter automata
- One-counter automata with counter observability
- scientific article; zbMATH DE number 1886071 (Why is no real title available?)
- The complexity of flat freeze LTL
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- scientific article; zbMATH DE number 7559493 (Why is no real title available?)
- scientific article; zbMATH DE number 7559494 (Why is no real title available?)
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Reachability for two-counter machines with one test and one reset
- The Parametric Complexity of Lossy Counter Machines
- The complexity of flat freeze LTL
- On parametric timed automata and one-counter machines
- Reachability for bounded branching VASS
- Continuous One-counter Automata
- Countdown games, and simulation on (succinct) one-counter nets
- Flat Parametric Counter Automata
- Flat Parametric Counter Automata
- Coverability in 2-VASS with one unary counter is in NP
- Mean-payoff optimization in continuous-time Markov chains with parametric alarms
- Dimension-minimality and primality of counter nets
- Lower bounds for the reachability problem in fixed dimensional VASSes
- Deciding hyperproperties combined with functional specifications
- Positive existential Definability with unit, addition and coprimeness
- Invariants for one-counter automata with disequality tests
- Improved algorithm for reachability in d-VASS
- Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
- Parikh one-counter automata
- Reactive synthesis for expected impacts
- New lower bounds for reachability in vector addition systems
- Synchronized CTL over one-counter automata
- Acyclic Petri and workflow nets with resets
- Monus semantics in vector addition systems with states
- The geometry of reachability in continuous vector addition systems with states
- Challenges of the reachability problem in infinite-state systems (invited paper)
- An introduction to the theory of linear integer arithmetic (invited paper)
- Reachability in symmetric VASS
- Reachability in vector addition system with states parameterized by geometric dimension
This page was built for publication: Reachability in Succinct and Parametric One-Counter Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184686)
