Modelling and Minimising the Fusion Calculus using HD-automata

We propose a coalgebraic model of the Fusion calculus based on HD-automata. The main advantage of the approach is that the partition refinement algorithm designed for HD-automata is easily adapted ...

[1]  John C. Mitchell,et al.  Foundations for programming languages , 1996, Foundation of computing series.

[2]  Marco Pistore,et al.  A Partition Refinement Algorithm for the -Calculus , 2001, Inf. Comput..

[3]  Marco Pistore,et al.  Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation , 2002, FoSSaCS.

[4]  Rod M. Burstall,et al.  Computational category theory , 1988, Prentice Hall International Series in Computer Science.

[5]  Björn Victor,et al.  The fusion calculus: expressiveness and symmetry in mobile processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[6]  Cosimo Laneve,et al.  Solos in Concert , 1999, ICALP.

[7]  Marco Pistore,et al.  π-Calculus, structured coalgebras, and minimal HD-automata , 2000 .

[8]  Ugo Montanari,et al.  History-Dependent Automata , 1998 .