[HTML][HTML] A formal approach to open multiparty interactions
We present a process algebra aimed at describing interactions that are multiparty, ie that
may involve more than two processes and that are open, ie the number of the processes …
may involve more than two processes and that are open, ie the number of the processes …
Open multiparty interaction
We present the link-calculus, a process calculus based on interactions that are multiparty, ie,
that may involve more than two processes and are open, ie, the number of involved …
that may involve more than two processes and are open, ie, the number of involved …
Symbolic semantics for multiparty interactions in the link-calculus
The link-calculus is a model for concurrency that extends the point-to-point communication
discipline of Milner's CCS with multiparty interactions. Links are used to build chains …
discipline of Milner's CCS with multiparty interactions. Links are used to build chains …
[HTML][HTML] The link-calculus for open multiparty interactions
We present the link-calculus, an extension of π-calculus, that models interactions that are
multiparty, ie that may involve more than two processes, mutually exchanging data …
multiparty, ie that may involve more than two processes, mutually exchanging data …
[HTML][HTML] A network-conscious π-calculus and its coalgebraic semantics
U Montanari, M Sammartino - Theoretical Computer Science, 2014 - Elsevier
Traditional process calculi usually abstract away from network details, modeling only
communication over shared channels. They, however, seem inadequate to describe new …
communication over shared channels. They, however, seem inadequate to describe new …
Proximity-based federation of smart objects: its graph-rewriting framework and correctness
Our real world environments today are filled with lots of embedded intelligent devices with
communication capabilities like smart phone, embedded computers, sensor devices, etc …
communication capabilities like smart phone, embedded computers, sensor devices, etc …
Reconfigurable and software-defined networks of connectors and components
R Bruni, U Montanari, M Sammartino - Software Engineering for Collective …, 2015 - Springer
The diffusion of adaptive systems motivate the study of models of software entities whose
interaction capabilities can evolve dynamically. In this paper we overview the contributions …
interaction capabilities can evolve dynamically. In this paper we overview the contributions …
Network-conscious π-calculus–a model of pastry
U Montanari, M Sammartino - Electronic Notes in Theoretical Computer …, 2015 - Elsevier
A peer-to-peer (p2p) system provides the networking substrate for the execution of
distributed applications. It is made of peers that interact over an overlay network. Overlay …
distributed applications. It is made of peers that interact over an overlay network. Overlay …
Verification techniques for a network algebra
Abstract The Core Network Algebra (CNA) is a model for concurrency that extends the point-
to-point communication discipline of Milner's CCS with multiparty interactions. Links are …
to-point communication discipline of Milner's CCS with multiparty interactions. Links are …
A Constraint-based Language for Multiparty Interactions
Multiparty interactions are common place in today's distributed systems. An agent usually
communicates, in a single session, with other agents to accomplish a given task. Take for …
communicates, in a single session, with other agents to accomplish a given task. Take for …