Mixed Nondeterministic-Probabilistic Automata
Abstract
Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. For modeling and formal verification of probabilistic systems, probabilistic automata were introduced. This paper proposes a coherent suite of models consisting of Mixed Systems, Mixed Bayesian Networks, and Mixed Automata, which extend factor graphs, Bayesian networks, and probabilistic automata with the handling of nondeterminism. Each of these models comes with a parallel composition, and we establish clear relations between these three models. Also, we provide a detailed comparison between Mixed Automata and Probabilistic Automata.
Fichier principal
HAL_Mixed_Nondeterministic_Probabilistic_Automata____HAL.pdf (888.01 Ko)
Télécharger le fichier
Origin | Publisher files allowed on an open archive |
---|---|
licence |
Copyright
|