Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
show main publications
Families of symmetries as efficient models of resource binding @INPROCEEDINGS{, title = {{Families of symmetries as efficient models of resource binding}}, author = {{Vincenzo} {Ciancia} and {Alexander} {Kurz} and {Ugo} {Montanari}}, booktitle = {Electronic Notes in Theoretical Computer Science}, note = {CMCS 2010 }, abstract = { Calculi that feature resource-allocating constructs (e.g. the
pi-calculus or the fusion calculus) require special kinds of
models. The best-known ones are presheaves and nominal sets. But
named sets have the advantage of being finite in a wide range of
cases where the other two are infinite. The three models are
equivalent. Finiteness of named sets is strictly related to the
notion of finite support in nominal sets and the corresponding
presheaves.
We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good computational properties to families. We generalise previous equivalence results by introducing a notion of minimal support in presheaf categories indexed over small categories of monos.
Functors and categories of coalgebras may be defined over families. We show that the final coalgebra has the greatest possible symmetry up-to bisimilarity, which can be computed by iteration along the terminal sequence, thanks to finiteness of the representation.
}, keywords = {bisimulation, coalgebras, decidability, history-dependent automata, minimization , Observational equivalences, presheaves, symmetry}, partner = {LEICESTER, PISA}, school = {University of Leicester, University of Pisa}, }
|