Concurrency and Probability: Removing Confusion, Compositionally

Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to resolve decisions by drawing from some probability distribution. Here we propose a general solution to this problem based on a recursive,...

Descripción completa

Detalles Bibliográficos
Autores: Bruni, Roberto Hector, Melgratti, Hernan Claudio, Montanari, Ugo
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2019
País:Argentina
Institución:Consejo Nacional de Investigaciones Científicas y Técnicas
Repositorio:CONICET Digital (CONICET)
Idioma:inglés
OAI Identifier:oai:ri.conicet.gov.ar:11336/123307
Acceso en línea:http://hdl.handle.net/11336/123307
Access Level:acceso abierto
Palabra clave:CONCURRENCY
CONFUSION
DYNAMIC NETS
OR CAUSALITY
PERSISTENT PLACES
PETRI NETS
PROBABILISTIC COMPUTATION
https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
Descripción
Sumario:Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to resolve decisions by drawing from some probability distribution. Here we propose a general solution to this problem based on a recursive, static decomposition of (occurrence) nets in loci of decision, called structural branching cells (s-cells). Each s-cell exposes a set of alternatives, called transactions. Our solution transforms a given Petri net, possibly with confusion, into another net whose transitions are the transactions of the s-cells and whose places are those of the original net, with some auxiliary nodes for bookkeeping. The resulting net is confusion-free by construction, and thus conflicting alternatives can be equipped with probabilistic choices, while nonintersecting alternatives are purely concurrent and their probability distributions are independent. The validity of the construction is witnessed by a tight correspondence with the recursively stopped configurations of Abbes and Benveniste. Some advantages of our approach are that: i) s-cells are defined statically and locally in a compositional way; ii) our resulting nets faithfully account for concurrency.