Coalgebraic Minimisation of HD-Automata for the π-calculus Using Polymorphic Types ?

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 minimisation algorithm for HD-automata derived from π-calculus agents. The algorithm is a generalisation of the partition refinement algorithm for classical automata and is… (More)

7 Figures and Tables

Topics

  • Presentations referencing similar topics