Please use this identifier to cite or link to this item:
Title: Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Authors: Ferrari, G.
Montanari, U.
Tuosto, E.
First Published: 2005
Citation: Theoretical Computer Science, 2005, 331 (02-Mar), pp.325-365
Abstract: 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 proved; moreover, the correspondence of the specification and the implementation is shown.
DOI Link: 10.1016/j.tcs.2004.09.021
ISSN: 0304-3975
Type: Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.