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

Creating Büchi Automata for Multi-valued Model Checking

Abstract: In explicit state model checking of linear temporal logic properties, a Buchi automaton encodes a temporal property It interleaves with a Kripke model to form a state space, which is searched for counterexamples Multi-valued model checking considers additional truth values beyond the Boolean \( true \) and \( false \); these values add extra information to the model, eg for the purpose of abstraction or execution steering This paper presents a method to create Buchi automata for multi-valued model checking using quasi-Boolean logics It allows for multi-valued propositions as well as multi-valued transitions A logic for the purpose of execution steering and abstraction is presented as an application

Hypergraph Automata: A Theoretical Model for Patterned Self-assembly

Abstract: Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate the computational power of SA-hypergraph automata and show that for every recognizable picture language, there exists an SA-hypergraph automaton that accepts this language. Conversely, we prove that for any restricted SA-hypergraph automaton, there exists a Wang Tile System, a model for recognizable picture languages, that accepts the same language. The advantage of SA-hypergraph automata over Wang automata, acceptors for the class of recognizable picture languages, is that they do not rely on an a priori defined scanning strategy.

A characterization of the class of structurally stable probabilistic automata II. Continuous-time case

Abstract: Hayashi et al. (1971) have investigated the problem of strong stability for a continuous time probabilistic automaton introduced by Knast (1969) as a generalization of discrete-time probabilistic automaton to the continuous-time case. In this paper, from the viewpoint of applying the conceptual framework of structural stability theory for dynamical systems over a compact differentiable manifold to the analysis of these problems for discrete-state stochastic systems, we attempt to extend their local (structural) stability theory for continuous-time probabilistic automata to a global one in such a sense as explained later. As a result of this investigation, it is revealed that a given continuous-time probabilistic automaton is structurally stable if and only if it is ergodic. Furthermore, we demonstrate that ‘ the class of all structurally stable continuous-time probabilistic automata is open, dense, convex and connected in the metric space of all continuous-time probabilistic automata over the fixed state ...