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
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Free-algebra models for the π -calculus
Theoretical Computer Science
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Modularity and Implementation of Mathematical Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Modelling fusion calculus using HD-Automata
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| 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. We characterise the transition relations induced by the coalgebraic model, observing the differences between the first two models. Furthermore by imposing conditions on history dependent automata, this model is shown to become equivalent to the sheaf-theoretic coalgebraic model.