Confusion-Tolerant Computation of Probability in Acyclic Nets

This paper presents a solution to the issue of how to compute probabilities in nets with confusion, where confusion is interference between concurrent choices of which enabled transition to perform. A formal framework is developed – using a novel formula based on event weights – for computing the probabilities of execution traces of an acyclic net, which in turn are used to compute the probabilities of the markings, steps, and nodes of the net. …