We introduce finite-state verification techniques for the pi-calculus whose design and correctness are justified coalgebraically. In particular, we formally specify and implement a minimization algorithm for HD-automata derived from pi-calculus agents. The algorithm is a generalization of the partition refinement algorithm for classical automata and is specified by a coalgebraic construction with polymorphic dependent types. The convergence of the algorithm is proved; moreover, the correspondence of the specification and the implementation is shown.
Coalgebraic minimization of HD-automata for the pi-calculus using polymorphic types
FERRARI, GIAN-LUIGI;MONTANARI, UGO GIOVANNI ERASMO;
2005-01-01
Abstract
We introduce finite-state verification techniques for the pi-calculus whose design and correctness are justified coalgebraically. In particular, we formally specify and implement a minimization algorithm for HD-automata derived from pi-calculus agents. The algorithm is a generalization of the partition refinement algorithm for classical automata and is specified by a coalgebraic construction with polymorphic dependent types. The convergence of the algorithm is proved; moreover, the correspondence of the specification and the implementation is shown.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
