Toggle Main Menu Toggle Search

Open Access padlockePrints

Confusion-Tolerant Computation of Probability in Acyclic Nets

Lookup NU author(s): Dr Anirban Bhattacharyya, Professor Maciej KoutnyORCiD



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.


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.

Publication metadata

Author(s): Bhattacharyya A, Koutny M

Publication type: Book Chapter

Publication status: Published

Book Title: Transactions on Petri Nets and Other Models of Concurrency

Year: 2023

Volume: 14150

Pages: 212-245

Print publication date: 01/11/2023

Online publication date: 01/11/2023

Acceptance date: 24/07/2023

Series Title: Lecture Notes in Computer Science

Publisher: Springer

Place Published: Berlin


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

ePrints DOI: 10.57711/zaaw-2475

Notes: Part of the series Lecture Notes in Computer Science

Library holdings: Search Newcastle University Library for this item

ISBN: 9783662681916