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

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.
Ferrari, GIAN-LUIGI; Montanari, UGO GIOVANNI ERASMO; Tuosto, E.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/206331
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 21
social impact