Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,160,410 papers from all fields of science
Search
Sign In
Create Free Account
Ω-automaton
Known as:
Streett automaton
, Rabin automaton
, Omega automata
Expand
In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of finite automaton that runs on…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Automata theory
Büchi automaton
Co-Büchi automaton
Generalized Büchi automaton
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Linear Time Logic and Deterministic omega-Automata
Joachim Klein
,
C. Baier
2005
Corpus ID: 3828084
2005
2005
DISPERSAL OF THE FIRE ANT DECAPITATING FLY, PSEUDACTEON CURVATUS (DIPTERA: PHORIDAE) IN NORTHEAST MISSISSIPPI
L. G. Thead
,
J. Vogt
,
D. Streett
2005
Corpus ID: 86191898
Pseudacteon curvatus Borgmeier is one of three species of phorid decapitating flies currently approved for release in the U.S…
Expand
Review
2003
Review
2003
In Search of the Physics: The Interplay of Experiment and Computation in Slat Aeroacoustics
M. Khorrami
,
Meelan Choudhari
,
B. Singer
,
D. Lockard
,
C. Streett
2003
Corpus ID: 13960254
The synergistic use of experiments and numerical simulations can uncover the underlying physics of airframe noise sources. We…
Expand
2001
2001
Safety and liveness in branching time
P. Manolios
,
Richard J. Trefler
Proceedings 16th Annual IEEE Symposium on Logic…
2001
Corpus ID: 11025774
Extends B. Alpern & F.B. Schneider's linear time characterization of safety and liveness properties to branching time, where…
Expand
2000
2000
Coping With Strong Fairness
T. Latvala
,
Keijo Heljanko
Fundamenta Informaticae
2000
Corpus ID: 7661859
We consider the verification of linear temporal logic (LTL) properties of Petri nets, where the transitions can have both weak…
Expand
2000
2000
Fair Equivalence Relations
O. Kupferman
,
Nir Piterman
,
Moshe Y. Vardi
Theory and Practice
2000
Corpus ID: 554585
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce…
Expand
1999
1999
Stutter-Invariant Languages, omega-Automata, and Temporal Logic
K. Etessami
International Conference on Computer Aided…
1999
Corpus ID: 22887414
Temporal logic and ω-automata are two of the common frameworks for specifying properties of reactive systems in modern…
Expand
1997
1997
A grand canonical simulation technique for dense and confined fluids with application to a Lennard-Jones fluid
P. Attard
1997
Corpus ID: 34525568
Grand canonical simulations, (specified chemical potential), are performed with a fixed number of particles by coupling…
Expand
Highly Cited
1995
Highly Cited
1995
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
Monika Henzinger
,
J. A. Telle
Scandinavian Workshop on Algorithm Theory
1995
Corpus ID: 18321987
This paper shows how a general technique, called lock-step search, used in dynamic graph algorithms, can be used to improve the…
Expand
1988
1988
Computation tree logic and regular omega-languages
W. Thomas
REX Workshop
1988
Corpus ID: 32327876
The expressive power of branching time logics is studied in the framework of the theory of ω-automata and ω-languages. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE