Bonchi, Filippo and Buscemi, Maria Grazia and Ciancia, Vincenzo and Gadducci, Fabio A Presheaf Environment for the Explicit Fusion Calculus. Journal of Automated Reasoning - Special issue on Binding, Substitution and Naming, 49 (2). pp. 161-183. ISSN 0168-7433 (2012)Full text not available from this repository.
Name passing calculi are nowadays one of the preferred formalisms for the specification of concurrent and distributed systems with a dynamically evolving topology. Despite their widespread adoption as a theoretical tool, though, they still face some unresolved semantic issues, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the π-calculus, are presheaf categories based on (injective) relabellings, such as SetI. Calculi with symmetric binding, in the spirit of the fusion calculus, give rise to novel research challenges. In this work we examine the explicit fusion calculus, and propose to model its syntax and semantics using the presheaf category SetE, where E is the category of equivalence relations and equivalence preserving morphisms.
|Additional Information:||This work was carried out during the first author’s tenure of an ERCIM “Alain Bensoussan” Fellowship Programme. The third author has been supported by the Comunidad de Madrid program ProMeSaS (S-0505/TIC/0407) and by the Netherlands Organization for Scientific Research VICI grant 639.073.501. The fourth author has been partly supported by the Italian Ministry of University and Research project SisteR (PRIN 20088HXMYN).|
|Uncontrolled Keywords:||Algebras; Coalgebras; Denotational semantics; Nominal calculi; Presheaf categories|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 29 not found.|
|Date Deposited:||07 Mar 2011 08:51|
|Last Modified:||06 Jul 2012 13:25|
Actions (login required)