Psi-calculi: a framework for mobile processes with nominal data and logic
From MaRDI portal
Publication:3003314
DOI10.2168/LMCS-7(1:11)2011zbMath1213.68399MaRDI QIDQ3003314
Jesper Bengtson, Joachim Parrow, Magnus Johansson, Björn Victor
Publication date: 26 May 2011
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity, Session-based concurrency, declaratively, Declarative event based models of concurrency and refinement in psi-calculi, Nominal SOS, A Behavioural Theory for a π-calculus with Preorders, Binary Session Types for Psi-Calculi, On the Expressiveness of Symmetric Communication, Stateful applied pi calculus: observational equivalence and labelled bisimilarity, Unnamed Item, When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, A stable non-interleaving early operational semantics for the pi-calculus, Expressiveness of concurrent intensionality, The reflective higher-order calculus: encodability, typability and separation, A PO characterisation of reconfiguration, Psi-calculi revisited: connectivity and compositionality, 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, Unnamed Item, Unnamed Item, Psi-calculi in Isabelle, Unnamed Item, A parametric framework for reversible \(\pi\)-calculi, Unnamed Item, Psi-calculi in Isabelle, A calculus of quality for robustness against unreliable communication, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, A complete symbolic bisimulation for full applied pi calculus, A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus, Ensuring liveness properties of distributed systems: open problems, A calculus for collective-adaptive systems and its behavioural theory, The Expressive Power of Monotonic Parallel Composition, A formal approach to the engineering of domain-specific distributed systems, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours, Typed ψ-calculi, Broadcast Psi-calculi with an Application to Wireless Protocols, PiStache: Implementing π-Calculus in Scala, A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract), Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem, Unnamed Item, Unnamed Item, Models and emerging trends of concurrent constraint programming
Uses Software
