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: The sampling problem is to decide whether there is a sampling rate such that all qualitative behaviors accepted by a given timed automaton in dense time semantics can be also accepted in sampled semantics and it is shown that this problem is decidable.
Abstract: Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study one aspect of the relation between these two semantics, namely checking whether the system exhibits some qualitative (untimed) behaviors in the dense time which cannot be reproduced by any implementation with a fixed sampling rate. More formally, the \emph{sampling problem} is to decide whether there is a sampling rate such that all qualitative behaviors (the untimed language) accepted by a given timed automaton in dense time semantics can be also accepted in sampled semantics. We show that this problem is decidable.
16 citations
TL;DR: It is proved that non-injective complementarity relations increase the accepting power of these systems and that although Watson-Crick automata are equivalent to two-head finite automata, this equivalence is not preserved when comparing parallel communicatingatson-Cricks automata systems and multi-head infinite automata.
16 citations
01 Jan 2009
16 citations
TL;DR: This work expands on a statistical framework for the synthesis of succinct quantum finite automata, discussing its adaptation to the case of multiperiodic events and languages, and introduces some promise problems for multi periodic inputs, showing that even on this class of problems the descriptional power of quantum finite Automata greatly outperforms that of equivalent classical finiteAutomata.
16 citations
TL;DR: It is shown that the upper bound of 2 n + 1 on the number of states of the corresponding reduced automaton can be attained for all n ⩾ 2, i.e., theupper bound 2 n - 1 is optimal.
16 citations