Interval probabilities of state transitions in probabilistic automata

Authors:
Henryk Piech;Olga Siedlecka-Lamch
Affiliations:
Czestochowa University of Technology, Poland;Czestochowa University of Technology, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 4
Cited 0

Composition and behaviors of probabilistic I/O automata

Theoretical Computer Science
Automata and Computability

Automata and Computability
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)
Iterative method for improving consistency of multi-attribute object judgments performed by teams of decision makers

KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Working principle of the probabilistic automaton is based on the state transition probability [4], [6]. Construction of the automaton depends on its purpose. We assume that all transitions probabilities are constant[3]. In situations where low levels of information (entropy) suggest assurance solutions, we use interval probabilities (remembering that the sum of the probabilities of transition to the given state must remain equal to 1). This variant generates additional problems, which are: how to prevent the redundancy of the probabilities sum; the physical interpretation of this situation; undervaluing of the probabilities sum; determine the criteria of the structure and parameters optimization (minimization) relative to the semantic resources of formal languages described by the automaton; change in the level of information entropy.