TY  - CHAP
ED  - Brim, Lubo?
ED  - Jancar, Petr
ED  - Kretínský, Mojmír
ED  - Kucera, Antonín
Y1  - 2002///
ID  - eprints131
PB  - Springer
UR  - http://dx.doi.org/10.1007/3-540-45694-5_30
SN  - 3-540-44043-7
T3  - Lecture Notes in Computer Science
A1  - Buscemi, Maria Grazia
A1  - Montanari, Ugo
N2  - In this paper, we propose a compositional coalgebraic semantics of the ?-calculus based on a novel approach for lifting calculi with structural axioms to coalgebraic models. We equip the transition system of the calculus with permutations, parallel composition and restriction operations, thus obtaining a bialgebra. No prefix operation is introduced, relying instead on a clause format defining the transitions of recursively defined processes. The unique morphism to the final bialgebra induces a bisimilarity relation which coincides with observational equivalence and which is a congruence with respect to the operations. The permutation algebra is enriched with a name extrusion operator ? ŕ la De Brujin, that shifts any name to the successor and generates a new name in the first variable x 0. As a consequence, in the axioms and in the SOS rules there is no need to refer to the support, i.e., the set of significant names, and, thus, the model turns out to be first order.
N1  - Extended version available as Technical
Report TR-02-14, Dipartimento di Informatica, Universitŕ di Pisa (http://compass2.di.unipi.it/TR/default.aspx?year=2002).
The final publication is available at www.springerlink.com
TI  - A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
EP  - 465
AV  - none
T2  - Proceedings of the 13th International Conference on Concurrency Theory (CONCUR ?02)
SP  - 449
M1  - 2421
ER  -