A theory of bisimulation for the &lgr;-calculus
Acta Informatica
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
A fully abstract model for the π-calculus
Information and Computation
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th 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
Models for name-passing processes: interleaving and causal
Information and Computation
Comparing Operational Models of Name-Passing Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Families of Symmetries as Efficient Models of Resource Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational presentations of functors and monads
Mathematical Structures in Computer Science
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A unifying formal basis for the SENSORIA approach: a white paper
Rigorous software engineering for service-oriented systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic model is considered both for presheaves over the category of finite sets and injections, and for its subcategory of atomic sheaves known as the Schanuel topos. Each coalgebra induces an indexed labelled transition system. Such transition systems are characterised, relating the coalgebraic approach to an existing model of name-passing. Further, we consider internal labelled transition systems within the sheaf topos, and axiomatise a class that is in precise correspondence with the coalgebraic and the indexed labelled transition system models. By establishing and exploiting the equivalence of the Schanuel topos with a category of named-sets, these internal labelled transition systems are also related to the theory of history dependent automata.