A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 isdoi:10.1016/j.tcs.2004.09.021 fatcat:kw2wbwvb6fa3fanowrnclv36vi