Formalising the π-Calculus Using Nominal Logic

DOI10.1007/978-3-540-71389-0_6zbMath1168.68436OpenAlexW2142929144MaRDI QIDQ5758048

Joachim Parrow, Jesper Bengtson

Publication date: 7 September 2007

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71389-0_6

zbMATH Keywords

nominal logicpi-calculusinteractive theorem provingbisimulation equivalenceimplementation in Isabelle/HOL

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Implementing Spi Calculus Using Nominal Techniques, ASP\(_{\text{fun}}\) : a typed functional active object calculus, Psi-calculi in Isabelle, Psi-calculi in Isabelle, Nominal techniques in Isabelle/HOL, Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem, Mechanizing the Metatheory of mini-XQuery, A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle, \( \pi\) with leftovers: a mechanisation in Agda

Uses Software

• Isabelle/HOL