ω-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.

Hybrid automata: a formal paradigm for heterogeneous modeling

Abstract: A hybrid automaton is a model of a system with interacting continuous and discrete dynamics. It has been successfully employed in emerging applications on the border between computer science and control theory. In this paper, hybrid automata are formally introduced. Some results on existence and uniqueness of executions for hybrid automata are obtained. Continuous dependence on initial states are shown for a class of hybrid automata. Zeno hybrid automata, i.e., hybrid automata that exhibit infinitely many discrete transitions in finite time, are also discussed.

Automata of high complexity and methods of increasing their reliability by redundancy

Abstract: A natural question regarding the limits of automation is: What are the limits of automata, or how closely can an automaton imitate the human being—what kind of specific processes can an automaton do better, more quickly, and more reliably than the human being? Aspects of these questions may be treated from the standpoint of automata theory. We will give brief summaries of two far-reaching theories in this field: the Turing theory of the possibilities of computing machines, and the von Neumann theory of self-reproducing automata. The question of reliability becomes rather serious when the complexity of the automaton becomes large. An attempt towards a theory of how redundancy should be applied on different levels for reducing the influence of temporary component errors in a universal computing machine is given.

Don't care words with an application to the automata-based approach for real addition

Abstract: Automata are a useful tool in infinite-state model checking, since they can represent infinite sets of integers and reals. However, analogous to the use of BDDS to represent finite sets, the sizes of the automata are an obstacle in the automata-based set representation. In this paper, we generalize the notion of don't cares for BDDS to word languages as a means to reduce the automata sizes. We show that the minimal weak deterministic Buchi automaton (WDBA) with respect to a given don't care set, under certain restrictions, is uniquely determined and can be efficiently constructed. We apply don't cares to improve the efficiency of a decision procedure for the first-order logic over the mixed linear arithmetic over the integers and the reals based on WDBAs.

Picture Recognizability with Automata Based on Wang Tiles

Abstract: We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang systems. Wang automata combine features of both online tessellation acceptors and 4-ways automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacent one, according to some scanning strategy. We prove that Wang automata recognize the class REC, i.e. they are equivalent to tiling systems or online tessellation acceptors, and hence strictly more powerful than 4-way automata. We also consider a very natural notion of determinism for Wang automata, and study the resulting class, comparing it with other deterministic classes considered in the literature, like DREC and Snake-DREC.

From Finite Automata toward Hybrid Systems (Extended Abstract)

Abstract: We consider two orthogonal extensions of the basic finite automaton paradigm and clarify to what degree and in what form do they preserve fundamental facts from the theory of finite automata. Hopefully, this approach facilitates a lucid adaptation of Automata Theory to Hybrid Systems.