Psi-calculi revisited: connectivity and compositionality

DOI10.1007/978-3-030-21759-4_1OpenAlexW2948544349MaRDI QIDQ6190177

Johannes Åman Pohjola

Publication date: 6 February 2024

Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21759-4_1

zbMATH Keywords

process algebrabisimulationnominal logicpsi-calculiinteractive theorem proving

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• A framework for security analysis of mobile wireless networks
• A behavioural theory for a \(\pi\)-calculus with preorders
• Nominal techniques in Isabelle/HOL
• The chemical abstract machine
• The revised report on the syntactic theories of sequential control and state
• Decoding choice encodings
• Towards a unified approach to encodability and separation results for process calculi
• Explicit fusions
• Is It a “Good” Encoding of Mixed Choice?
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Broadcast Psi-calculi with an Application to Wireless Protocols
• A Behavioural Theory for a π-calculus with Preorders
• Name-Passing Calculi: From Fusions to Preorders and Types
• On Distributability in Process Calculi
• Psi-calculi in Isabelle

This page was built for publication: Psi-calculi revisited: connectivity and compositionality