%O 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
%I Springer
%V 2421
%T A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence
%P 449-465
%B Proceedings of the 13th International Conference on Concurrency Theory (CONCUR ?02)
%R 10.1007/3-540-45694-5_30
%S Lecture Notes in Computer Science
%A Maria Grazia Buscemi
%A Ugo Montanari
%E Lubo? Brim
%E Petr Jancar
%E Mojm?r Kret?nsk?
%E Anton?n Kucera
%X 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.
%L eprints131
%D 2002