Skip to Main content Skip to Navigation

pNets: an Expressive Model for Parameterised Networks of Processes (Extended Version)

Ludovic Henrio 1, * Eric Madelaine 1, * Min Zhang 2
* Corresponding author
1 SCALE - Safe Composition of Autonomous applications with Large-SCALE Execution environment
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This article studies Parameterised Networks of Automata (pNets) from a theoretical perspective. We illustrate the expressiveness of pNets by showing how to express a wide range of classical constructs of (value-passing) process calculi, but also how we can easily express complex interaction patterns used in modern distributed systems. Our framework can model full systems, using (closed) hierarchies of pNets; we can also build (open) pNet systems expressing composition operators. Concerning more fundamental aspects, we define a strong bisimulation theory specifically for the pNet model, prove its properties, and illustrate it on some examples. One of the original aspects of the approach is to relate the compositional nature of pNets with the notion of bisimulation; this is exemplified by studying the properties of a flattening operator.
Complete list of metadata
Contributor : Eric Madelaine <>
Submitted on : Monday, August 11, 2014 - 2:07:20 PM
Last modification on : Tuesday, January 12, 2021 - 8:44:01 AM
Long-term archiving on: : Tuesday, April 11, 2017 - 7:29:07 PM


Files produced by the author(s)


  • HAL Id : hal-01055091, version 1


Ludovic Henrio, Eric Madelaine, Min Zhang. pNets: an Expressive Model for Parameterised Networks of Processes (Extended Version). [Research Report] RR-8579, 2014, pp.22. ⟨hal-01055091v1⟩



Record views


Files downloads