Model checking mobile processes
From MaRDI portal
Publication:1817220
DOI10.1006/inco.1996.0072zbMath0864.68036OpenAlexW1973627522MaRDI QIDQ1817220
Publication date: 1 December 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/54a331011df5f0dbe6d587f82fe98cfa6eaae6cc
Related Items
A spatial logic for concurrency. I, On the Relationship between π-Calculus and Finite Place/Transition Petri Nets, A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus, Unnamed Item, Unnamed Item, On the decidability of process equivalences for the \(\pi\)-calculus, Unnamed Item, Using session types for reasoning about boundedness in the \(\pi\)-calculus, Inference systems for observation equivalences in the \(\pi\)-calculus, On the decidability of fragments of the asynchronous π-calculus, A Complete Axiomatic System for a Process-Based Spatial Logic, A Logic for True Concurrency, Decidable Extensions of Hennessy-Milner Logic, Multiple-Labelled Transition Systems for nominal calculi and their logics, Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS, A theory of structural stationarity in the \(\pi\)-calculus, An Epistemic Predicate CTL* for Finite Control π-Processes, A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
