Equivalence checking for a finite higher order π-calculus

Authors:
Zining Cao
Affiliations:
Department of Computer Science and Technology, Nanjing University of Aero. and Astro., Nanjing, P.R. China
Venue:
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Year:
2008

Citing 9
Cited 0

Deciding bisimulation equivalences for a class of non-finite-state programs

Information and Computation
Symbolic bisimulations

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Algebraic theories for name-passing calculi

Information and Computation
Bisimulation for higher-order process calculi

Information and Computation
Communication and Concurrency

Communication and Concurrency
Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Efficient Local Correctness Checking

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Complete inference systems for weak bisimulation equivalences in the π-calculus

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.