Confusion-Tolerant Computation of Probability in Acyclic Nets

Bhattacharyya, A; Koutny, M

doi:10.1007/978-3-662-68191-6_9

Confusion-Tolerant Computation of Probability in Acyclic Nets

Lookup NU author(s): Dr Anirban Bhattacharyya, Emeritus Professor Maciej Koutny ORCiD

Downloads

Accepted version [.pdf]

Licence

This is the authors' accepted manuscript of a book chapter that has been published in its final definitive form by Springer, 2023.

For re-use rights please refer to the publisher's terms and conditions.

Abstract

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. We prove the framework satisfies generic probability requirements. We also prove the formula simplifies to the standard formula for computing the probability of independent concurrent events in confusion-free concurrent simple acyclic nets with choice, in the maximally concurrent and interleaving models of concurrency.