Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation

We address the problem of minimizing labelled transition systems for name passing calculi. We show how the co-algebraic formulation of automata with naming directly suggests an effective minimization algorithm which reduces the number of states to be analyzed in the verification of properties for name passing process calculi.

[1]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[2]  Marco Pistore,et al.  Verifying Mobile Processes in the HAL Environment , 1998, CAV.

[3]  Catherine A. Meadows.  Open Issues in Formal Methods for Cryptographic Protocol Analysis , 2001, MMM-ACNS.

[4]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[5]  Reiko Heckel,et al.  Compositional SOS and beyond: a coalgebraic view of open systems , 2002, Theor. Comput. Sci..

[6]  Andrew M. Pitts,et al.  Category Theory and Computer Science , 1987, Lecture Notes in Computer Science.

[7]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[8]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[9]  Edmund M. Clarke,et al.  Formal Methods: State of the Art and Future Directions Working Group Members , 1996 .

[10]  José D. P. Rolim,et al.  Automata, Languages and Programming , 2002, Lecture Notes in Computer Science.

[11]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[12]  Marco Pistore,et al.  Checking Bisimilarity for Finitary pi-Calculus , 1995, CONCUR.

[13]  Marco Pistore,et al.  History dependent verification for partial order systems , 1997, Partial Order Methods in Verification.

[14]  Marco Pistore,et al.  An Automated Based Verification Environment for Mobile Processes , 1997, TACAS.

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

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

[17]  Ugo Montanari,et al.  CONCUR '96: Concurrency Theory , 1996, Lecture Notes in Computer Science.

[18]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[19]  Marco Pistore,et al.  Efficient Minimization up to Location Equivalence , 1996, ESOP.

[20]  James Worrell,et al.  Terminal sequences for accessible endofunctors , 1999, CMCS.

[21]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

[22]  Jean-Claude Fernandez,et al.  An Implementation of an Efficient Algorithm for Bisimulation Equivalence , 1990, Sci. Comput. Program..

[23]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

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

[25]  Mads Dam.  On the Decidability of Process Equivalences for the pi-Calculus , 1997, Theor. Comput. Sci..