This paper provides an elementary introduction to the probabilistic automaton (PA) model, which has been developed by Segala. We describe how distributed systems with discrete probabilities can be modeled and analyzed by means of PAs. We explain how the basic concepts for the analysis of nonprobabilistic automata can be extended to probabilistic systems. In particular, we treat the parallel composition operator on PAs, the semantics of a PA as a set of trace distributions, an extension of the PA model with time and simulation relations for PAs. Finally, we give an overview of various other state based models that are used for the analysis of probabilistic systems.
CITATION STYLE
Introduction to probabilistic automata. (1972). Discrete Mathematics, 3(4), 406–407. https://doi.org/10.1016/0012-365x(72)90124-0
Mendeley helps you to discover research relevant for your work.