Safety verification for two-way finite automata with monotonic counters

Authors:
Oscar H. Ibarra;Zhe Dang;Zhi-Wei Sun
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;Department of Mathematics, Nanjing University, Nanjing, China
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 15
Cited 1

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)
Parametric real-time reasoning

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A theory of timed automata

Theoretical Computer Science
New Decidability Results Concerning Two-Way Counter Machines

SIAM Journal on Computing
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Using the ASTRAL model checker to analyze mobile IP

Proceedings of the 21st international conference on Software engineering
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems

Proceedings of the 22nd international conference on Software engineering
Symbolic Model Checking

Symbolic Model Checking
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

Hybrid Systems II
Binary Reachability Analysis of Discrete Pushdown Timed Automata

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications

On the solvability of a class of diophantine equations and applications

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We look at a model of a two-way nondeterministic finite automaton augmented with monotonic counters operating on inputs of the form a1i1 ...anin for some fixed n and distinct symbols a1, ..., an, where i1, ..., in are nonnegative integers. Our results concern the following Presburger safety verification problem: Given a machine M, a state q, and a Presburger relation E over counter values, is there (i1, ..., in) such that M, when started in its initial state on the left end of the input a1i1 ...anin with all counters initially zero, reaches some configuration where the state is q and the counter values satisfy E? We give positive and negative results for different variations and generalizations of the model (e.g., augmenting the model with reversal-bounded counters, discrete clocks, etc.). In particular, we settle an open problem in [10].