The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hilbert's tenth problem
New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Two-Way Counter Machines and Diophantine Equations
Journal of the ACM (JACM)
Symbolic Model Checking
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Timed Automata and the Theory of Real Numbers
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On two-way FA with monotonic counters and quadratic Diophantine equations
Theoretical Computer Science
On composition and lookahead delegation of e-services modeled by automata
Theoretical Computer Science
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the joint spectral radius for bounded matrix languages
RP'10 Proceedings of the 4th international conference on Reachability problems
Composability of infinite-state activity automata
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e., the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of w1* ... wk* for some nonnull words w1, ..., wk) is decidable, settling an open problem in [11,12]. The proof is a rather involved reduction to the solution of a special class of Diophantine systems of degree 2 via a class of programs called two-phase programs. The result has applications to verification of infinite state systems.