activity
20112026
most citedConnector algebras for C/E and P/T nets' interactions

41 citations · 68 across the 15 of their papers we have counts for

collaborators

17 papers

cs.LO2026

On Asynchrony and Reversibility in CCS

Hernán Melgratti, Claudio Antares Mezzina, G. Michele Pinna

Asynchronous communication is a fundamental feature of modern distributed systems, where messages are emitted without requiring immediate synchronization with receivers. In process…

cs.DC2026

Compositional Design, Implementation, and Verification of Swarms (Technical Report)

Florian Furbach, Lucas Clorius, Roland Kuhn +3

Swarm protocols are a recently introduced formalism for specifying, implementing, and verifying peer-to-peer systems called swarms. A swarm consists of distributed agents called ma…

cs.PL2026

JoinActors: A Modular Library for Actors with Join Patterns

Ayman Hussein, Philipp Haller, Ioannis Karras +3

Join patterns are a high-level programming construct for message-passing applications. They offer an intuitive and declarative approach for specifying how concurrent and distribute…

cs.CL2023

A Reversible Perspective on Petri Nets and Event Structures

Hernán Melgratti, Claudio Antares Mezzina, G. Michele Pinna

Event structures have emerged as a foundational model for concurrent computation, explaining computational processes by outlining the events and the relationships that dictate thei…

cs.DC2023

Behavioural Types for Local-First Software

Roland Kuhn, Hernán Melgratti, Emilio Tuosto

Peer-to-peer systems are the most resilient form of distributed computing, but the design of robust protocols for their coordination is difficult. This makes it hard to specify and…

cs.LO2023

Relating Reversible Petri Nets and Reversible Event Structures, categorically

Hernán Melgratti, Claudio Antares Mezzina, G. Michele Pinna

Causal nets (CNs) are Petri nets where causal dependencies are modelled via inhibitor arcs. They play the role of occurrence nets when representing the behaviour of a concurrent an…

cs.LO2020★ 1 cited

Towards Refinable Choreographies

Ugo de'Liguoro, Hernán Melgratti, Emilio Tuosto

We investigate refinement in the context of choreographies. We introduce refinable global choreographies allowing for the underspecification of protocols, whose interactions can be…

cs.LO2020

Probabilistic Analysis of Binary Sessions

Omar Inverso, Hernán Melgratti, Luca Padovani +2

We study a probabilistic variant of binary session types that relate to a class of Finite-State Markov Chains. The probability annotations in session types enable the reasoning on…

cs.LO2019

Reversible Causal Nets and Reversible Event Structures

Hernán Melgratti, Claudio Antares Mezzina, Iain Phillips +2

One of the well-known results in concurrency theory concerns the relationship between event structures and occurrence nets: an occurrence net can be associated with a prime event s…

cs.LO2019★ 8 cited

Reversing Place Transition Nets

Hernán Melgratti, Claudio Antares Mezzina, Irek Ulidowski

Petri nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack…

cs.SE2019★ 2 cited

On Resolving Non-determinism in Choreographies

Laura Bocchi, Hernan Melgratti, Emilio Tuosto

Choreographies specify multiparty interactions via message passing. A realisation of a choreography is a composition of independent processes that behave as specified by the choreo…

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★ 3 cited

Multiparty testing preorders

Rocco de Nicola, Hernán Melgratti

Variants of the must testing approach have been successfully applied in service oriented computing for analysing the compliance between (contracts exposed by) clients and servers o…

cs.FL2013★ 41 cited

Connector algebras for C/E and P/T nets' interactions

Roberto Bruni, Hernan Melgratti, Ugo Montanari +1

A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors. In a recent p…

cs.PL2011★ 1 cited

Contracts for Abstract Processes in Service Composition

Maria Grazia Buscemi, Hernán Melgratti

Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compa…