In this paper, we present an algorithm for checking weak context bisimulation over a finite higher order π-calculus, called linear higher order π-calculus. To achieve this aim, we propose a new bisimulation, called linear normal bisimulation, and furthermore prove the equivalence between context bisimulation and linear normal bisimulation for such linear higher order π-calculus. The correctness of this algorithm is also demonstrated. At last, we give a complete inference system for linear higher order π-calculus. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Cao, Z. (2008). Equivalence checking for a finite higher order π-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4966 LNCS, pp. 30–47). https://doi.org/10.1007/978-3-540-79124-9_4
Mendeley helps you to discover research relevant for your work.