Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
5 results

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

Roberto Bruni ; Hernan Melgratti ; Ugo Montanari ; Pawel Sobocinski.
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 paper, an algebra of stateless connectors was presented that consists of five kinds of basic connectors, namely symmetry,&nbsp;[&hellip;]
Published on September 17, 2013

Symbolic and Asynchronous Semantics via Normalized Coalgebras

Filippo Bonchi ; Ugo Montanari.
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since the behaviour of interactive systems is for many reasons&nbsp;[&hellip;]
Published on May 16, 2011

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 computational fields are particularly appealing for allowing components to join and leave with little or no overhead.&nbsp;[&hellip;]
Published on March 22, 2017

Event Structures for Petri nets with Persistence

Paolo Baldan ; Roberto Bruni ; Andrea Corradini ; Fabio Gadducci ; Hernan Melgratti ; Ugo Montanari.
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 the approach to concurrency proposed by Petri. A basic role is played by an unfolding construction that maps (safe)&nbsp;[&hellip;]
Published on September 28, 2018

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 by drawing from some probability distribution. Here we propose a general solution based on a recursive, static&nbsp;[&hellip;]
Published on December 19, 2019

  • < Previous
  • 1
  • Next >