Psi-calculi: a framework for mobile processes with nominal data and logic
From MaRDI portal
Recommendations
Cited in
(49)- A complete symbolic bisimulation for full applied pi calculus
- Ensuring liveness properties of distributed systems: open problems
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- Session-based concurrency, declaratively
- Expressiveness of concurrent intensionality
- A parametric framework for reversible \(\pi\)-calculi
- A calculus for collective-adaptive systems and its behavioural theory
- A formal approach to the engineering of domain-specific distributed systems
- Models and emerging trends of concurrent constraint programming
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity
- A stable non-interleaving early operational semantics for the pi-calculus
- Declarative event based models of concurrency and refinement in psi-calculi
- A sorted semantic framework for applied process calculi
- The expressive power of monotonic parallel composition
- A class of automata for the verification of infinite, resource-allocating behaviours
- A sorted semantic framework for applied process calculi (extended abstract)
- Typed ψ-calculi
- Broadcast psi-calculi with an application to wireless protocols
- PiStache: implementing -calculus in Scala
- Reasoning about constants in Nominal Isabelle or how to formalize the second fixed point theorem
- Nominal SOS
- Binary session types for psi-calculi
- On the expressiveness of symmetric communication
- Context-free session types for applied pi-calculus
- scientific article; zbMATH DE number 7447776 (Why is no real title available?)
- A behavioural theory for a \(\pi\)-calculus with preorders
- ASP\(_{\text{fun}}\) : a typed functional active object calculus
- Repairing time-determinism in the process algebra for hybrid systems
- Computing strong and weak bisimulations for psi-calculi
- A calculus of quality for robustness against unreliable communication
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- scientific article; zbMATH DE number 7288621 (Why is no real title available?)
- A fully abstract symbolic semantics for psi-calculi
- A characterisation of open bisimilarity using an intuitionistic modal logic
- Trustworthy Global Computing
- A stable non-interleaving early operational semantics for the pi-calculus
- Higher-order psi-calculi
- Modal logics for nominal transition systems
- Psi-calculi in Isabelle
- Psi-calculi in Isabelle
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- The reflective higher-order calculus: encodability, typability and separation
- A generic type system for higher-order \(\Psi\)-calculi
- A PO characterisation of reconfiguration
- Psi-calculi revisited: connectivity and compositionality
- Encodability and separation for a reflective higher-order calculus
- A generic type system for higher-order -calculi
- Formal methods for mobile ad hoc networks: a survey
- Broadcast Psi-calculi
This page was built for publication: Psi-calculi: a framework for mobile processes with nominal data and logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003314)
