activity
20022018
most citedSoft Concurrent Constraint Programming

45 citations · 131 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LO2018★ 2 cited

Unifying Inference for Bayesian and Petri Nets

Roberto Bruni, Hernán Melgratti, Ugo Montanari

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 constr…

cs.LO2018★ 9 cited

Event Structures for Petri nets with Persistence

Paolo Baldan, Roberto Bruni, Andrea Corradini +3

Event structures are a well-accepted model of concurrency. In a seminal paper by Nielsen, Plotkin and Winskel, they are used to establish a bridge between the theory of domains and…

cs.LO2017★ 1 cited

Concurrency and Probability: Removing Confusion, Compositionally

Roberto Bruni, Hernán Melgratti, Ugo Montanari

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…

cs.LO2016★ 22 cited

Asynchronous Distributed Execution Of Fixpoint-Based Computational Fields

Alberto Lluch Lafuente, Michele Loreti, Ugo Montanari

Coordination is essential for dynamic distributed systems whose components exhibit interactive and autonomous behaviors. Spatially distributed, locally interacting, propagating com…

cs.LO2015★ 3 cited

A coalgebraic semantics for causality in Petri nets

Roberto Bruni, Ugo Montanari, Matteo Sammartino

In this paper we revisit some pioneering efforts to equip Petri nets with compact operational models for expressing causality. The models we propose have a bisimilarity relation an…

cs.LO2015★ 4 cited

Dynamic Programming on Nominal Graphs

Nicklas Hoch, Ugo Montanari, Matteo Sammartino

Many optimization problems can be naturally represented as (hyper) graphs, where vertices correspond to variables and edges to tasks, whose cost depends on the values of the adjace…