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
Proceedings ArticleDOI
28 Jul 2008
TL;DR: This paper defines the notion of liveness for constraint automata as a set of infinite runs and shows that the definitions of weak and strong fairness requirements, as they expect, satisfy the liveness requirements.
Abstract: Constraint automata as acceptors of timed data streams are the semantic models of component connectors specified in the language of Reo. In this paper, we investigate the augmentation of the theory of constraint automata by live- ness and fairness requirements. We define the notion of liveness for constraint automata as a set of infinite runs and show that our definitions of weak and strong fairness requirements, as we expect, satisfy the liveness requirements. It is shown that live or fair constraint automata can be composed using extended versions of the join operator for ordinary constraint automata such that, the resulted automaton itself be live or fair, respectively. Also, we present a linear temporal logic interpreted over infinite strings of transitions of constraint automata as a specification language for their properties. This temporal logic can be used as the specification language in the field of model checking. We show that our defined fairness conditions can be expressed not only by sets of computations but also by temporal formulas in the proposed linear temporal logic of steps.

1 citations

Journal Article
TL;DR: This paper gives a sufficient condition for a composition to admit a finite complete system under the isomorphic representation, which reduces the question to a graph coloring problem.
Abstract: In the theory of compositions of finite automata it is a central problem to study systems from which every automaton can be built under a given composition and representation. Such systems are called complete with respect to the considered composition and representation. From practical and theoretical points of view, those compositions and representations have great importance for which there are finite complete systems. Under the isomorphic embedding as representation, a graph theoretical necessary condition of the existence of finite complete systems is presented in [3]. In this paper, we give a sufficient condition for a composition to admit a finite complete system under the isomorphic representation, which reduces the question to a graph coloring problem.

1 citations

Posted Content
TL;DR: In the book, the main concepts of probabilistic automata theory are presented and three algorithms, namely LaSalle's algorithm, Bayesian inference, and consequentialism are presented.
Abstract: In the book we present main concepts of probabilistic automata theory.

1 citations

Journal ArticleDOI
01 Oct 2014-PLOS ONE
TL;DR: An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven and indicates a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case.
Abstract: Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case.

1 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