Topic
ω-automaton
About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.
Papers published on a yearly basis
Papers
More filters
23 Aug 1993
TL;DR: An automata-theoretic framework for branching-time temporal logics is presented, and a new type of finite automata on infinite trees, the amorphous automata are introduced and used as a formalism to represent efficiently CTL formulas.
Abstract: An automata-theoretic framework for branching-time temporal logics is presented. We introduce a new type of finite automata on infinite trees, the amorphous automata, and use them as a formalism to represent efficiently CTL formulas. In addition, we introduce simultaneous trees, and associate with every model for CTL, a simultaneous tree that enables a tree automaton to visit different nodes on the same path of the tree simultaneously. With every formula ψ, we associate an amorphous automaton Uψ, that accepts exactly those simultaneous trees (of any branching degree) that originate from models that satisfy ψ. This enables to use the automaton both for model checking which is reduced to the membership problem, and for satisfiability decision, which is reduced to testing the nonemptiness of an extension of Uψ that does not assume simultaneous input trees.
24 citations
24 Aug 1992
TL;DR: A new algorithm is developed that shows that the number of nondeterministic moves of a finite automaton, if limited, is bounded by $2^{n} - 2$ where $n$ isThe number of states.
Abstract: We develop a new algorithm for determining if a given nondeterministic finite automaton is limited in nondeterminism. From this, we show that the number of nondeterministic moves of a finite automaton, if limited, is bounded by \(2^{n} - 2\) where \(n\) is the number of states. If the finite automaton is over a one-letter alphabet, using Gohon's result the number of nondeterministic moves, if limited, is less than \(n^{2}\). In both cases, we present families of finite automata demonstrating that the upper bounds obtained are almost tight. We also show that the limitedness problem of the number of nondeterministic moves of finite automata is PSPACE-hard. Since the problem is already known to be in PSPACE, it is therefore PSPACE-complete.
24 citations
TL;DR: The related problem of determining the minimum energy level of arbitrary automata is shown to be NP-hard, which has important implications for simulating and analyzing QDCA on conventional computers.
24 citations
01 Jan 2002
TL;DR: It is found that a large number of modular discrete-event system verification problems are also PSPACE-complete, even for prefix-closed cases, suggesting that while system decomposition by parallel composition could lead to significant space savings, it may not lead to sufficient time savings that would aid in the study of "large-scale" systems.
Abstract: Investigates issues related to the computational complexity of automata intersection problems. For several classes of problems, comparing the behavior of sets of interacting finite automata is found to be PSPACE-complete even in the case of automata accepting prefix-closed languages (equivalently, even when all states are marked). The paper uses these results to investigate the computational complexity of problems related to the verification of supervisory controllers for modular discrete-event systems. Modular discrete-event systems are sets of finite automata combined by the parallel composition operation. We find that a large number of modular discrete-event system verification problems are also PSPACE-complete, even for prefix-closed cases. These results suggest that while system decomposition by parallel composition could lead to significant space savings, it may not lead to sufficient time savings that would aid in the study of "large-scale" systems.
24 citations
Posted Content•
TL;DR: It is shown how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines, characterized in the language of automata theory and adapted to a recent algorithm for generating accessible deterministic finite automata.
Abstract: Author(s): Johnson, B. D.; Crutchfield, J. P.; Ellison, C. J.; McTague, C. S. | Abstract: We show how to efficiently enumerate a class of finite-memory stochastic processes using the causal representation of epsilon-machines. We characterize epsilon-machines in the language of automata theory and adapt a recent algorithm for generating accessible deterministic finite automata, pruning this over-large class down to that of epsilon-machines. As an application, we exactly enumerate topological epsilon-machines up to eight states and six-letter alphabets.
23 citations