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: It is shown that deterministic automata do not have the same expressive power, and it is proved that rational sets of words of finite ranks are closed under complementation.
4 citations
TL;DR: A new formalism for fault-tolerant control of nondeterministic Input/Output automata is presented, based on a combination of set theory, Boolean operators and automata unfolding.
4 citations
05 Aug 2014
TL;DR: It is shown that regularity is decidable for deterministic set automata and a conversion procedure into deterministic finite automata which leads to a double exponential upper bound is described and proved to be tight in the order of magnitude.
Abstract: The descriptional complexity of deterministic and nondeterministic set automata is investigated. Set automata are basically finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether or not an element is in the set. We show that regularity is decidable for deterministic set automata and describe a conversion procedure into deterministic finite automata which leads to a double exponential upper bound. This bound is proved to be tight in the order of magnitude by presenting also a double exponential lower bound. In contrast to these recursive bounds we obtain non-recursive trade-offs when nondeterministic set automata are considered.
4 citations
02 Jul 2007
TL;DR: (max,+) automata are used as a model of a class of timed discrete event systems and their supervisory control is developped and the concept of supervised product is introduced to control (max,+ automata) and its properties are studied.
Abstract: (max,+) automata, an important class of both timed automata and weighted automata, are used as a model of a class of timed discrete event systems and their supervisory control is developped. The concept of supervised product is introduced to control (max,+) automata and its properties are studied. Decomposition of morphism matrix of the controlled system based on the tensor dioid algebra is proposed and the supervisory control of (max,+) automata is studied using residuation theory of formal power series. Finally we discuss the synchronous composition of (max,+) automata that yields a more general class of timed automata: product interval automata.
4 citations
17 Jul 2013
TL;DR: A timed control synthesis approach is proposed for hybrid systems modeled with rectangular hybrid automata to constrain the reachable state spaces by the addition of desired control specifications to the automaton transition guards.
Abstract: A timed control synthesis approach is proposed for hybrid systems modeled with rectangular hybrid automata. The control goal is to constrain the reachable state spaces by the addition of desired control specifications to the automaton transition guards, and to determine in a maximal permissive way the transition dates that respect those constraints. The approach is illustrated via a production system.
4 citations