Modelling 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 to handle Fusion calculus processes. Hence, the transition systems of Fusion calculus processes can be minimised according to the notion of observational semantics of the calculus. As a beneficial side effect, this also provides a bisimulation checker for Fusion calculus.

[1]  Björn Victor,et al.  Relationally Staged Computations in Calculi of Mobile Processes , 2004, CMCS.

[2]  Luca Cardelli,et al.  Modern concurrency abstractions for C# , 2002, TOPL.

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

[4]  Huimin Lin.  Complete inference systems for weak bisimulation equivalences in the pi-calculus , 2003, Inf. Comput..

[5]  Emilio Corchado,et al.  Intelligent Data Engineering and Automated Learning - IDEAL 2006, 7th International Conference, Burgos, Spain, September 20-23, 2006, Proceedings , 2006, IDEAL.

[6]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

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

[8]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[9]  Faron Moller,et al.  The Mobility Workbench - A Tool for the pi-Calculus , 1994, CAV.

[10]  Rocco De Nicola,et al.  A Symbolic Semantics for the π-calculus , 1994 .

[11]  Emilio Tuosto,et al.  Coalgebraic Minimisation of HD-Automata for the -Calculus in a Polymorphic -Calculus , 2004 .

[12]  Peter Sewell,et al.  Models for name-passing processes: interleaving and causal , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[13]  Roberto Bruni,et al.  Theoretical foundations for compensations in flow composition languages , 2005, POPL '05.

[14]  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).

[15]  Sam Staton,et al.  Comparing Operational Models of Name-Passing Process Calculi , 2004, CMCS.

[16]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[17]  G. Ferrari,et al.  Modular Verification of Systems via Service Coordination ? , 2004 .

[18]  Cosimo Laneve,et al.  Foundations of Web Transactions , 2005, FoSSaCS.

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

[20]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[21]  Fabio Gadducci,et al.  About permutation algebras and sheaves (and named sets, too!) , 2003 .

[22]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[23]  Emilio Tuosto,et al.  Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types , 2005, Theor. Comput. Sci..

[24]  Emilio Tuosto,et al.  From Co-algebraic Specifications to Implementation: The Mihda Toolkit , 2002, FMCO.

[25]  Faron Mollerz,et al.  The Mobility Workbench | a Tool for the -calculus | , 1994 .

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

[27]  Joachim Parrow,et al.  An algebraic verification of a mobile network , 1992, Formal Aspects of Computing.

[28]  Emilio Tuosto,et al.  Polyadic History-Dependent Automata for the Fusion Calculus , 2003 .

[29]  Marco Pistore,et al.  pi-Calculus, Structured Coalgebras, and Minimal HD-Automata , 2000, MFCS.

[30]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[31]  Sylvain Conchon,et al.  Jocaml: mobile agents for Objective-Caml , 1999, Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents.