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 P automata characterize the recursively enumerable sets of vectors of natural numbers.
Abstract: In this paper, we propose a class of P automata in which each membrane has a state, like in tissue P systems [5], and the computation starts at some initial state and ends in a final state. Unlike the automaton considered in [2], where rules are used in sequential manner, here we consider a variant such that the rules can be applied in maximal mode (as defined in tissue P systems). We show that P automata characterize the recursively enumerable sets of vectors of natural numbers.
14 citations
04 Jul 2012
TL;DR: A simple fragment of CTL is proposed that is able to express properties about accumulated weights along maximal runs of multiweighted modal automata by equipped with a game-based semantics and guaranteeing both soundness and completeness.
Abstract: Multiweighted modal automata provide a specification theory for multiweighted transition systems that have recently attracted interest in the context of energy games. We propose a simple fragment of CTL that is able to express properties about accumulated weights along maximal runs of multiweighted modal automata. Our logic is equipped with a game-based semantics and guarantees both soundness (formula satisfaction is propagated to the modal refinements) as well as completeness (formula non-satisfaction is propagated to at least one of its implementations). We augment our theory with a summary of decidability and complexity results of the generalized model checking problem, asking whether a specification -- abstracting the whole set of its implementations -- satisfies a given formula.
14 citations
TL;DR: The concept and formulation of a signed real measure of regular languages for analysis of discrete-event supervisory control systems, constructed based upon the principles of language theory and real analysis, provides a precise quantitative comparison of the controlled plant behavior under different supervisors.
14 citations
Book•
01 Dec 1995
TL;DR: In this chapter, Markov's chains elementary queueing theory queueing networks is studied as an algebraic approach to non-deterministic automata's theory.
Abstract: Automata's theory - a basic elementary approach automata's theory - an algebraic approach non-deterministic automata's theory Markov's chains elementary queueing theory queueing networks.
14 citations
TL;DR: Hierarchies of automata operating on two-dimensional tapes are investigated and it is shown that finite automata with n+3 markers (n+2 heads) are strictly more powerful than those with n markers ( n heads).
Abstract: Hierarchies of automata operating on two-dimensional tapes are investigated. In particular, it is shown that finite automata with n+3 markers (n+2 heads) are strictly more powerful than those with n markers (n heads)
14 citations