Notions of computation and monads
Information and Computation
A calculus of mobile processes, I
Information and Computation
Formal Methods in System Design - Special issue on symmetry in automatic verification
Semantic constructions for the specification of objects
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Efficient Minimization up to Location Equivalence
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
A Category of Explicit Fusions
Concurrency, Graphs and Models
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Science of Computer Programming
Symmetries, local names and dynamic (de)-allocation of names
Information and Computation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
Network Conscious π-calculus: A Concurrent Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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.