Operational Semantics for PBC with Asynchronous Communication - Archive ouverte HAL Access content directly
Conference Papers Year : 2002

Operational Semantics for PBC with Asynchronous Communication

Raymond Devillers
  • Function : Author
Hanna Klaudel
Maciej Koutny
  • Function : Author
Elisabeth Pelz


This paper presents two related algebras which can be used to specify and analyse concurrent systems with synchronous and asynchronous communications. The first algebra is based on a class of P/T-nets, called boxes, and their standard transition firing rule. It is an extension of the Petri Box Calculus (PBC). Essentially, the original model is enriched with the introduction of special buffer places where different transitions (processes) may deposit and remove tokens, together with an explicit asynchronous communication operator, denoted by tie, allowing to make them private. We also introduce an algebra of process expressions corresponding to such a net algebra, by augmenting the existing syntax of PBC expressions, and defining a system of SOS rules providing their operational semantics. The two algebras are related through a mapping which, for any extended box expression, returns a corresponding box with an isomorphic transition system.
Fichier principal
Vignette du fichier
2002-hpc.pdf (123.5 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00114684 , version 1 (17-11-2006)


  • HAL Id : hal-00114684 , version 1


Raymond Devillers, Hanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau. Operational Semantics for PBC with Asynchronous Communication. 2002, pp.1-6. ⟨hal-00114684⟩
86 View
34 Download


Gmail Facebook X LinkedIn More