Concurrent nets: a study of prefixing in process calculi - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2006

Concurrent nets: a study of prefixing in process calculi

Résumé

We introduce the calculus of concurrent nets as an extension of the fusion calculus in which usual prefixing is replaced by arbitrary monotonic guards. Then we use this formalism to describe the prefixing policy of standard calculi as a particular form of communication. By developing a graphical syntax, we sharpen the geometric intuition and finally we provide an encoding of these guards as causality in the prefix-free fragment, in the spirit of the encoding of the fusion calculus into solos by Laneve and Victor, proving that communication by fusion is expressive enough to implement arbitrary monotonic guards.

Dates et versions

hal-00151817 , version 1 (05-06-2007)

Identifiants

Citer

Emmanuel Beffara, François Maurel. Concurrent nets: a study of prefixing in process calculi. Theoretical Computer Science, 2006, 356 (3), pp.356-373. ⟨10.1016/j.tcs.2006.02.009⟩. ⟨hal-00151817⟩
74 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More