A calculus of mobile processes, II
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Algebraic set theory
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
On the structure of categories of coalgebras
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
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
Category Theory and Computer Science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
On the final sequence of a finitary set functor
Theoretical Computer Science
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
General Structural Operational Semantics through Categorical Logic
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A domain equation for bisimulation
Information and Computation
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Journal of Logic and Computation
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Final sequences and final coalgebras for measurable spaces
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Presenting functors on many-sorted varieties and applications
Information and Computation
Coalgebraic semantics for parallel derivation strategies in logic programming
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Similarity quotients as final coalgebras
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 Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
An algebraic presentation of predicate logic
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
A labelled transition system can be understood as a coalgebra for a particular endofunctor on the category of sets. Generalizing, we are led to consider coalgebras for arbitrary endofunctors on arbitrary categories. Bisimulation is a crucial notion in the theory of labelled transition systems. We identify four definitions of bisimulation on general coalgebras. The definitions all specialize to the same notion for the special case of labelled transition systems. We investigate general conditions under which the four notions coincide. As an extended example, we consider the semantics of name-passing process calculi (such as the pi-calculus), and present a new coalgebraic model for name-passing calculi.