Book ChapterDOI
Real-Counter automata and their decision problems
Zhe Dang,Oscar H. Ibarra,Pierluigi San Pietro,Gaoyan Xie +3 more
- pp 198-210
TLDR
Real-Counter Automata as mentioned in this paper are two-way finite automata augmented with counters that take real values, which accept real words that are bounded and closed real intervals delimited by a finite number of markers.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.read more
Citations
More filters
Journal ArticleDOI
On partially blind multihead finite automata
Oscar H. Ibarra,Bala Ravikumar +1 more
TL;DR: This work is concerned with 1-way multihead finite automata, both deterministic and nondeterministic, in which the symbol under only one head controls its move, and calls such a FA a partially blind multihead FA.
Journal ArticleDOI
Reachability in Timed Counter Systems
TL;DR: In this paper, the authors introduce a new class of systems mixing clocks and counters, called timed counter systems, which have an infinite state space and their reachability problems are generally undecidable.
Journal Article
Reachability in Timed Counter Systems.
TL;DR: By abstracting clock values with a Region Graph, the Counter Reachability Problem is shown to be decidable for three subclasses: Timed VASS, Bounded Timed Counter Systems, and Reversal-Bounded Timing Counter Systems.
Journal Article
Binary reachability analysis of discrete pushdown timed automata
TL;DR: The binary reachability of a discrete timed automaton can be accepted by a nondeterministic reversal-bounded multicounter machine and the results can be used to verify a number of properties that can not be expressed by timed temporal logics for discrete timing automata and CTL* for pushdown systems.
Journal ArticleDOI
Dense-choice Counter Machines revisited
TL;DR: Using the first-order additive mixed theory of reals and integers, this paper gives a logical characterization of the sets of configurations reachable by reversal-bounded Dense-choice Counter Machines.
References
More filters
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI
Automatic verification of finite-state concurrent systems using temporal logic specifications
TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.
An Automata-Theoretic Approach to Automatic Program Verification
Moshe Y. Vardi,Pierre Wolper +1 more
Book ChapterDOI
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
TL;DR: This work presents two semidecision procedures for verifying safety properties of piecewiselinear hybrid automata, in which all variables change at constant rates, and demonstrates that for many of the typical workshop examples, the procedures do terminate and thus provide an automatic way for verifying their properties.
Journal ArticleDOI
HYTECH: a model checker for hybrid systems
TL;DR: HyTech is a symbolic model checker for linear hybrid automata, a subclass of hybrids that can be analyzed automatically by computing with polyhedral state sets that combines automaton transitions for capturing discrete change with differential equations for capturing continuous change.