Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types

Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto
2005 Theoretical Computer Science  
We introduce finite-state verification techniques for the -calculus whose design and correctness are justified coalgebraically. In particular, we formally specify and implement a minimization algorithm for HD-automata derived from -calculus agents. The algorithm is a generalization of the partition refinement algorithm for classical automata and is specified as a coalgebraic construction defined using →, , , a polymorphic -calculus with dependent types. The convergence of the algorithm is
more » ... ; moreover, the correspondence of the specification and the implementation is shown.
doi:10.1016/j.tcs.2004.09.021 fatcat:kw2wbwvb6fa3fanowrnclv36vi