Higher-order psi-calculi

DOI10.1017/S0960129513000170zbMATH Open1342.68239MaRDI QIDQ5740353FDOQ5740353

Authors: Joachim Parrow, Johannes Borgström, Palle Raabjerg, Johannes Åman Pohjola 

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 7288621
• Psi-calculi in Isabelle
• Psi-calculi in Isabelle
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Priorities without priorities: representing preemption in psi-calculi

Mathematics Subject Classification ID

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

Cites Work

• Nominal techniques in Isabelle/HOL
• Nominal logic, a first order theory of names and binding
• Bisimulation for higher-order process calculi
• On the bisimulation proof method
• Plain CHOCS. A second generation calculus for higher order processes
• Asynchronous process calculi: The first- and higher-order paradigms

Cited In (15)

• A generic type system for higher-order \(\Psi\)-calculi
• Psi-calculi in Isabelle
• A case study in programming coinductive proofs: Howe's method
• Title not available (Why is that?)
• \(\mathrm{HO}\pi\) in Coq
• A generic type system for higher-order \(\Psi\)-calculi
• A sorted semantic framework for applied process calculi (extended abstract)
• Psi-calculi revisited: connectivity and compositionality
• HOCore in Coq
• Psi-calculi in Isabelle
• Encodability and separation for a reflective higher-order calculus
• Modeling and efficient verification of wireless ad hoc networks
• Title not available (Why is that?)
• The reflective higher-order calculus: encodability, typability and separation
• Priorities without priorities: representing preemption in psi-calculi

This page was built for publication: Higher-order psi-calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740353)