Location of Repository

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

By G. Ferrari, U. Montanari and E. Tuosto

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

Year: 2005
DOI identifier: 10.1016/j.tcs.2004.09.021
OAI identifier: oai:lra.le.ac.uk:2381/1846
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2381/184... (external link)
  • http://www.sciencedirect.com/s... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.