Comparing operational models of name-passing process calculi

Authors:
Marcelo Fiore;Sam Staton
Affiliations:
Computer Laboratory, University of Cambridge, UK;Computer Laboratory, University of Cambridge, UK
Venue:
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Year:
2006

Citing 6
Cited 6

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

Coalgebraic Modal Logic Beyond Sets

Electronic Notes in Theoretical Computer Science (ENTCS)
A Well-behaved LTS for the Pi-calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
A Name Abstraction Functor for Named Sets

Electronic Notes in Theoretical Computer Science (ENTCS)
A Categorical Model of the Fusion Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
A congruence rule format for name-passing process calculi

Information and Computation
Symmetries, local names and dynamic (de)-allocation of names

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.