163 search results - page 29 / 33 » An Introduction to Probabilistic Automata |
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
We survey on the theoretical and practical developments of the theory of fuzzy logic and soft computing. Specifically, we briefly review the history and main milestones of fuzzy ...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
ENTCS
2006
13 years 7 months ago
2006
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural...
TSMC
2002
13 years 7 months ago
2002
Abstract--We present the STack ARchitecture (STAR) automaton. It is a fixed structure, multiaction, reward-penalty learning automaton, characterized by a star-shaped state transiti...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...