scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
11 Oct 2011
TL;DR: It is shown that universal weighted automata in the sum semantics can represent all polynomials, and it is argued that a summation semantics is of interest too, as it captures the intuition that one has to pay for the cost of all conjuncts.
Abstract: In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools In this setting, the correspondence between disjunctions/conjunctions in the specification and nondeterministic/universal transitions in the automaton for the specification is straightforward A recent exciting research direction aims at adding a quality measure to the satisfaction of specifications of reactive systems The corresponding automata-theoretic framework is based on weighted automata, which map input words to numerical values In the weighted setting, nondeterminism has a minimum semantics - the weight that an automaton assigns to a word is the cost of the cheapest run on it For universal branches, researchers have studied a (dual) maximum semantics We argue that a summation semantics is of interest too, as it captures the intuition that one has to pay for the cost of all conjuncts We introduce and study alternating weighted automata on finite words in both the max and sum semantics We study the duality between the min and max semantics, closure under max and sum, the added power of universality and alternation, and arithmetic operations on automata In particular, we show that universal weighted automata in the sum semantics can represent all polynomials

14 citations

Journal ArticleDOI
TL;DR: It is shown that language inclusion for languages of infinite words defined by nondeterministic automata can be tested in polynomial time if the automata are unambiguous and have simple acceptance conditions, namely safety or reachability conditions.

14 citations

Proceedings ArticleDOI
01 Dec 2014
TL;DR: This paper considers the computation of indistinguishable state pairs of nondeterministic finite automata where some transitions of the automata are observable whereas other transitions are not observable.
Abstract: In this paper we consider the computation of indistinguishable state pairs of nondeterministic finite automata where some transitions of the automata are observable whereas other transitions are not observable. Two states are indistinguishable if they are reached from the initial state of their corresponding automaton by sequences of transitions that are observationally identical. We review a known algorithm for computing indistinguishable state pairs of automata. We demonstrate for a specific parameterized example that this algorithm is in Θ(|X|4·|Σ|) where X is the state set and Σ the event set of the input automaton. We define a product on nondeterministic finite automata which can be used for computing indistinguishable state pairs of automata. When the input automaton is deterministic (respectively, nondeterministic) with respect to its observable transitions, computation of indistinguishable state pairs by use of the product is in O(|X|2·|Σ| + |X|3) (resp., O(|X|4·|Σ|)).

14 citations

Book ChapterDOI
01 Jan 1980
TL;DR: The chapter explains that there are deficiencies in the theory of automata and the deficiencies are reparable and the automata are so much more complicated that they would be used in formal proofs only with great awkwardness and when a proof by means of grammars is for some reason not feasible.
Abstract: Publisher Summary This chapter discusses the relationship between formal languages and automata. The relationship is a weak one and proceeds in only one direction. Automata are used as acceptors to define languages; therefore, the languages can be considered the external behavior of their acceptors and that end the relationship. There is no application of results from language theory to the study of automata. The chapter explains that there are deficiencies in the theory of automata and the deficiencies are reparable. The automata may be more intuitive than that of grammars; however, automata are so much more complicated that they would be used in formal proofs only with great awkwardness and when a proof by means of grammars is for some reason not feasible. A finite-state automaton is not always the best way to describe a regular set. There is no single method of representing regular sets that is always the most convenient to use.

13 citations

Journal ArticleDOI
TL;DR: A method for determining multilinear state space models for general finite state automata is presented and the cyclic structure of the state space is shown to be determined only by the periods of the elementary divisor polynomials of the system dynamics.

13 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Data structure
28.1K papers, 608.6K citations
83% related
Model checking
16.9K papers, 451.6K citations
83% related
Approximation algorithm
23.9K papers, 654.3K citations
82% related
Petri net
25K papers, 406.9K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202219
20201
20191
20185
201748