Operational Semantics for PBC with Asynchronous Communication

Abstract : 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.
Type de document :
Communication dans un congrès
2002, SCS, pp.1-6, 2002
Liste complète des métadonnées

Contributeur : Franck Pommereau <>
Soumis le : vendredi 17 novembre 2006 - 13:45:32
Dernière modification le : jeudi 13 décembre 2018 - 09:46:03
Document(s) archivé(s) le : mardi 6 avril 2010 - 22:57:22


Fichiers éditeurs autorisés sur une archive ouverte


  • HAL Id : hal-00114684, version 1



Raymond Devillers, Hanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau. Operational Semantics for PBC with Asynchronous Communication. 2002, SCS, pp.1-6, 2002. 〈hal-00114684〉



Consultations de la notice


Téléchargements de fichiers