TY - GEN
A1 - Lautenbach, Kurt
A1 - Susewind, Kerstin
T1 - Probability Propagation Nets and Duality
N2 - The paper deals with a specific introduction into probability propagation nets. Starting from dependency nets (which in a way can be considered the maximum information which follows from the directed graph structure of Bayesian networks), the probability propagation nets are constructed by joining a dependency net and (a slightly adapted version of) its dual net. Probability propagation nets are the Petri net version of Bayesian networks. In contrast to Bayesian networks, Petri nets are transparent and easy to operate. The high degree of transparency is due to the fact that every state in a process is visible as a marking of the Petri net. The convenient operability consists in the fact that there is no algorithm apart from the firing rule of Petri net transitions. Besides the structural importance of the Petri net duality there is a semantic matter; common sense in the form of probabilities and evidencebased likelihoods are dual to each other.
T3 - Arbeitsberichte, FB Informatik - 2012,11
KW - Petri-Netze
KW - probability propagation nets
Y1 - 2012
UR - https://kola.opus.hbz-nrw.de/frontdoor/index/index/docId/691
UR - https://nbn-resolving.org/urn:nbn:de:kola-6912
ER -