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 published on a yearly basis
Papers
More filters
TL;DR: In this decomposition there are no practical limitations to the complexity of the decomposed automaton, to the number of component automata and to the mode of their connection.
3 citations
01 Mar 1963
TL;DR: From the basic theory, presented in this report, efficient techniques for the synthesis of sequential machine networks are derived by also considering admissible decompositions (overlapping partitions) of finite automata.
Abstract: : The basic ideas of an algebraic decomposition theory of finite automata are presented. These ideas are generalized by also considering admissible decompositions (overlapping partitions) of finite automata. Further research is required in order to derive from the basic theory, presented in this report, efficient techniques for the synthesis of sequential machine networks. On the other hand, the extension of some of the results obtained in this report to abstract algebras in general might be of some interest.
3 citations
Proceedings Article•
15 Feb 2006TL;DR: It is shown that the addition of alternation, timing, and determinism to finite automata increase their expressive and descriptional parallel power, as measured by the size of the automaton which has immediate practical applications in software and real-time systems.
Abstract: A new type of timed alternating finite automata (TAFA) called omega deterministic timed alternating finite automata (Ω-DTAFA) is described. DTAFA and Ω-DTAFA are synchronous and parallel computational models used for modeling real-time constraints computations and developing software systems. These models are extended with a finite set of mutually exclusive real-valued clocks on events which trigger the state transitions of the automaton. We consider some well-known automata-theoretic properties of TAFA, and investigate those properties in the case of Ω-DTAFA. We then show that, unlike timed finite automata (TFA) and TAFA, Ω-DTAFA are closed under all Boolean operations, including the complementation. Moreover, we show that the addition of alternation, timing, and determinism to finite automata increase their expressive and descriptional parallel power, as measured by the size of the automaton which has immediate practical applications in software and real-time systems.
3 citations
13 Jun 2006
TL;DR: This thesis proposes implementable semantics for timed automata and gives new algorithmic approaches to the analysis of hybrid automata whose dynamics is given by an affine function of its variables.
Abstract: In the field of formal verification of real-time systems, major developments have been recorded in the last fifteen years. It is about logics, automata, process algebra, programming languages, etc. From the beginning, a formalism has played an important role: timed automata and their natural extension,hybrid automata. Those models allow the definition of real-time constraints using real-valued clocks, or more generally analog variables whose evolution is governed by differential equations. They generalize finite automata in that their semantics defines timed words where each symbol is associated with an occurrence timestamp.The decidability and algorithmic analysis of timed and hybrid automata have been intensively studied in the literature. The central result for timed automata is that they are positively decidable. This is not the case for hybrid automata, but semi-algorithmic methods are known when the dynamics is relatively simple, namely a linear relation between the derivatives of the variables.With the increasing complexity of nowadays systems, those models are however limited in their classical semantics, for modelling realistic implementations or dynamical systems.In this thesis, we study the algorithmics of complex semantics for timed and hybrid automata.On the one hand, we propose implementable semantics for timed automata and we study their computational properties: by contrast with other works, we identify a semantics that is implementable and that has decidable properties. On the other hand, we give new algorithmic approaches to the analysis of hybrid automata whose dynamics is given by an affine function of its variables.
3 citations
01 Oct 2012
TL;DR: Two classes of on-the-fly emptiness checking algorithms, one based on nested DFS (NDFS) and another based on strongly connected components (SCC) are surveyed and two important emptiness checking theorems for deciding the product automata nonempty are summarized.
Abstract: Emptiness checking is a key operation in the automata-theoretic model checking approach to LTL verification Explicit state model checkers typically construct the automata on-the-fly and explore their states using depth-first search (DFS) We first cover the fundamentals of emptiness checking and summarize two important emptiness checking theorems for deciding the product automata nonempty We then survey two classes of on-the-fly emptiness checking algorithms, one based on nested DFS (NDFS) and another based on strongly connected components (SCC) Both can be done on classic Buchi automaton with a single acceptance condition and transition-based generalized Buchi automaton with multiple acceptance conditions We also highlight cases where both algorithms can be useful Finally we outline some new achievements and areas that require further research
3 citations