Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
From MaRDI portal
Publication:3638083
DOI10.1007/978-3-642-02930-1_3zbMath1248.68346OpenAlexW2112588218MaRDI QIDQ3638083
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_3
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Petri Nets with Structured Data ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Spatial and behavioral types in the pi-calculus ⋮ A spatial equational logic for the applied \(\pi \)-calculus ⋮ The Decidability of the Reachability Problem for CCS!
This page was built for publication: Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types