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
••
01 Sep 2009TL;DR: This work uses the boundary region graph introduced by Jurdzinski and Trivedi to analyse properties of concavely-priced (non-probabilistic) timed automata and proves that these problems are EXPTIME-complete for probabilistic timed Automata with two or more clocks and PTIME- complete for automata with one clock.
Abstract: Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-complete for automata with one clock. Previous work on expected price problems for probabilistic timed automata was restricted to expected reachability for linearly-priced automata and integer valued initial states. This work uses the boundary region graph introduced by Jurdzinski and Trivedi to analyse properties of concavely-priced (non-probabilistic) timed automata.
30 citations
••
TL;DR: This paper investigates functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs, showing that functionality is decidable for the four measures and whether the language associated with a given functional automaton can be defined with a deterministic one.
Abstract: A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we show that functionality is decidable for the four measures. Furthermore, the existential and universal threshold problems, the language inclusion problem and the equivalence problem are all decidable when the weighted automata are functional. On the negative side, we also study the quantitative extension of the realizability problem and show that it is undecidable for sum, mean and ratio. We finally show how to decide whether the language associated with a given functional automaton can be defined with a deterministic one, for sum, mean and discounted sum. The results on functionality and determinizability are expressed for the more general class of functional group automata. This allows one to formulate within the same framework new results related to discounted sum automata and known results on sum and mean automata. Ratio automata do not fit within this general scheme and different techniques are required to decide functionality.
30 citations
••
15 Aug 2002TL;DR: In this paper, a notion of probabilistic reversible automata (PRA) is introduced and a strong relationship between different possible models of PRA and corresponding models of quantum finite automata is found.
Abstract: To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
30 citations
01 Feb 1997
TL;DR: A model of nondeterministic nite automaton over ((nite) partial orders) captures existential monadic second-order logic in expressive power and generalizes classical word automata and tree automata.
30 citations
••
17 Aug 2000
TL;DR: It is shown that weak and strong bisimilarity of pushdown automata and finite automata is PSPACE-hard, but polynomial for every fixed finite automaton.
Abstract: All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and finite automata is PSPACE-hard, even for a small fixed finite automaton, (2) Strong bisimilarity of pushdown automata and finite automata is PSPACE-hard, but polynomial for every fixed finite automaton, (3) Regularity (finiteness) of pushdown automata w.r.t. weak and strong bisimilarity is PSPACE-hard.
30 citations