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

On the Structure of Linear Cellular Automata

Abstract: We introduce a new class of cellular automata, much richer than the classical one. These one dimensional cellular automata, called here linear, are presented together with their properties in the first section of the paper. We characterize linear functions which are global transition functions for certain bounded linear cellular automata. Finally, some results concerning the limit sets and a remarkable structure for isometric linear cellular automata are also included.

Controlled timed automata

Abstract: We examine some extensions of the basic model, due to Alur and Dill, of real-time automata (RTA). Our model, controlled real-time automata, is a parameterized family of real-time automata with some additional features like clock stopping, variable clock velocities and periodic tests. We illustrate the power of controlled automata by presenting some languages that can be recognized deterministically by such automata, but cannot be recognized non-deterministically by any other previously introduced class of timed automata (even with e-transitions). On the other hand, due to carefully chosen restrictions, controlled automata conserve basic properties of RTA: the emptiness problem is decidable and for each fixed parameter the family of recognized real-time languages is closed under boolean operations.

Automata on Infinite Trees with Counting Constraints

Abstract: We investigate finite automata on infinite trees with the usual Muller criterion for the success of an infinite computation path, but with the acceptance paradigm modified in that not all the computation paths need to be successful Instead, it is required that the number of successful paths must belong to a specified set of cardinals Γ We show that Muller automata with the acceptance constraint of the form “there are at least γ accepting paths” can be always simulated by tree automata with a weaker criterion for successful paths, namely Buchi acceptance condition We also show that this is the most general class of constraints for which a simulation by Buchi automata is always possible Next, we characterize the maximal class of constraints which can be simulated by classical Muller automata (known to be more powerful than Buchi automata) The condition requiered of the set Γ there, is that the intersection with natural numbers forms a recognizable set Finally, we exhibit a set of trees which is recognized by a classical Buchi automaton but fails to be recognized by any Muller automaton with a non trivial cardinality constraint (ie, except for Γ = 0)

A fast transition of linear temporal logic formulae to transition-based Büchi automata

Abstract: This paper presents an algorithm based on revised tableau rules, which converts linear temporal logic formulae to transition-based Buchi automata more efficiently. The algorithm is geared towards being used in model checking in on-the-fly fashion. The algorithm circumvents the intermediate steps and the simplification process that follows, and therefore performs more efficiently. By attaching the satisfaction information of the infinite sequence on states and transitions, we can judge whether the runs of the automata are acceptable by using only one acceptance condition set, but not multiple ones. On-the-fly simplifications as well as binary decision diagram presentation are adopted in the algorithm to gain significant reduction both on the size of product automata and on the computational complexity. It can expand the state nodes while detecting the validity of these, removing the invalid nodes and combining equivalent states and transitions. By comparative testing with other conversion tools, the algorithm runs faster, with fewer states and transitions of the automaton.