Bayesian network semantics for Petri nets

Abstract Recent work by the authors equips Petri occurrence nets (PN) with probability distributions which fully replace nondeterminism. To avoid the so-called confusion problem, the construction imposes additional causal dependencies which restrict choices within certain subnets called structural branching cells (s-cells). Bayesian nets (BN) are usually structured as partial orders where nodes define conditional probability distributions. In the paper, we unify the two structures in terms of Symmetric Monoidal Categories (SMC), so that we can apply to PN ordinary analysis techniques developed for BN. Interestingly, it turns out that PN which cannot be SMC-decomposed are exactly s-cells. This result confirms the importance for Petri nets of both SMC and s-cells.

[1]  Stefan Haar,et al.  Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net , 2009, FORMATS.

[2]  Roberto Bruni,et al.  Connector algebras for C/E and P/T nets' interactions , 2013, Log. Methods Comput. Sci..

[3]  Bart Jacobs,et al.  Disintegration and Bayesian Inversion, Both Abstractly and Concretely , 2017, ArXiv.

[4]  Manfred Kudlek,et al.  Probability in Petri Nets , 2005, Fundam. Informaticae.

[5]  Kishor S. Trivedi,et al.  Extended Stochastic Petri Nets: Applications and Analysis , 1984, Performance.

[6]  Bart Jacobs,et al.  A Formal Semantics of Influence in Bayesian Reasoning , 2017, MFCS.

[7]  Fabio Gadducci,et al.  Petri nets are dioids: a new algebraic foundation for non-deterministic net theory , 2018, Acta Informatica.

[8]  J. Pearl Causality: Models, Reasoning and Inference , 2000 .

[9]  Albert Benveniste,et al.  True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures , 2006, Inf. Comput..

[10]  Stefan Haar,et al.  Probabilistic Cluster Unfoldings , 2002, Fundam. Informaticae.

[11]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[12]  Filippo Bonchi,et al.  Diagrammatic algebra: from linear to concurrent systems , 2019, Proc. ACM Program. Lang..

[13]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[14]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[15]  Michael K. Molloy Discrete Time Stochastic Petri Nets , 1985, IEEE Transactions on Software Engineering.

[16]  Roberto Bruni,et al.  Concurrency and Probability: Removing Confusion, Compositionally , 2017, LICS.

[17]  Roberto Bruni,et al.  Functorial Models for Petri Nets , 2001, Inf. Comput..

[18]  Roberto Bruni,et al.  Event Structures for Petri nets with Persistence , 2018, Log. Methods Comput. Sci..

[19]  Diego Latella,et al.  Modeling Systems by Probabilistic Process Algebra: an Event Structures Approach , 1993, FORTE.

[20]  Lijun Zhang,et al.  A Semantics for Every GSPN , 2013, Petri Nets.

[21]  Bart Jacobs,et al.  Causal Inference by String Diagram Surgery , 2018, FoSSaCS.

[22]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[23]  Reiko Heckel,et al.  Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets , 2007, Log. Methods Comput. Sci..

[24]  Bart Jacobs,et al.  A Predicate/State Transformer Semantics for Bayesian Learning , 2016, MFPS.