Real-Counter automata and their decision problems

Authors:
Zhe Dang;Oscar H. Ibarra;Pierluigi San Pietro;Gaoyan Xie
Affiliations:
School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA;Department of Computer Science, University of California, Santa Barbara, CA;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italia;School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA
Venue:
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2004

Citing 25
Cited 1

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
A theory of timed automata

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

SIAM Journal on Computing
What's decidable about hybrid automata?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Mixed real-integer linear quantifier elimination

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
On Context-Free Languages

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
Timed regular expressions

Journal of the ACM (JACM)
A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters

Constraints
A Closed Form for Datalog Queries with Integer Order

ICDT '90 Proceedings of the Third International Conference on Database Theory
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Algebraic Characterization of Data and Timed Languages

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Integration Graphs: A Class of Decidable Hybrid Systems

Hybrid Systems
Binary Reachability Analysis of Discrete Pushdown Timed Automata

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An Approach to the Description and Analysis of Hybrid Systems

Hybrid Systems
Symbolic Verification with Periodic Sets

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
HYTECH: A Model Checker for Hybrid Systems

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Generalized discrete timed automata: decidable approximations for safety verification

Theoretical Computer Science - Computing and combinatorics
Presburger liveness verification of discrete timed automata

Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification

Theoretical Computer Science
Back to the future: towards a theory of timed regular languages

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Automatic verification of multi-queue discrete timed automata

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

On partially blind multihead finite automata

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce real-counter automata, which are two-way finite automata augmented with counters that take real values. In contrast to traditional word automata that accept sequences of symbols, real-counter automata accept real words that are bounded and closed real intervals delimited by a finite number of markers. We study the membership and emptiness problems for one-way/two-way real-counter automata as well as those automata further augmented with other unbounded storage devices such as integer-counters and pushdown stacks.