Concurrent nets: a study of prefixing in process calculi

Abstract : 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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2006, 356 (3), pp.356-373. 〈10.1016/j.tcs.2006.02.009〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00151817
Contributeur : Emmanuel Beffara <>
Soumis le : mardi 5 juin 2007 - 13:55:49
Dernière modification le : jeudi 17 mai 2018 - 12:52:03

Lien texte intégral

Identifiants

Collections

PPS | USPC

Citation

Emmanuel Beffara, François Maurel. Concurrent nets: a study of prefixing in process calculi. Theoretical Computer Science, Elsevier, 2006, 356 (3), pp.356-373. 〈10.1016/j.tcs.2006.02.009〉. 〈hal-00151817〉

Partager

Métriques

Consultations de la notice

75