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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00114684
Contributor : Franck Pommereau <>
Submitted on : Friday, November 17, 2006 - 1:45:32 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 10:57:22 PM

File

2002-hpc.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00114684, version 1

Collections

Citation

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

Share

Metrics

Record views

165

Files downloads

59