pNets: an Expressive Model for Parameterised Networks of Processes - Archive ouverte HAL Access content directly
Conference Papers Year :

pNets: an Expressive Model for Parameterised Networks of Processes

(1) , (1) , (2)
1
2

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 encode 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 for pNets.
Fichier principal
Vignette du fichier
pdp4pad-4.pdf (324.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01139432 , version 1 (07-04-2015)

Identifiers

  • HAL Id : hal-01139432 , version 1

Cite

Ludovic Henrio, Eric Madelaine, Min Zhang. pNets: an Expressive Model for Parameterised Networks of Processes. Formal Approaches to Parallel and Distributed Systems (4PAD)-Special Session of Parallel, Distributed and network-based Processing (PDP), 2015, Turku, Finland. ⟨hal-01139432⟩
202 View
149 Download

Share

Gmail Facebook Twitter LinkedIn More