The following pages link to Model checking mobile processes (Q1817220):
Displaying 18 items.
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- Inference systems for observation equivalences in the \(\pi\)-calculus (Q1974214) (← links)
- Using session types for reasoning about boundedness in the \(\pi\)-calculus (Q2216475) (← links)
- An Epistemic Predicate CTL* for Finite Control π-Processes (Q2825420) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus (Q3185762) (← links)
- A Complete Axiomatic System for a Process-Based Spatial Logic (Q3599152) (← links)
- Decidable Extensions of Hennessy-Milner Logic (Q3613068) (← links)
- On the decidability of fragments of the asynchronous π-calculus (Q4917084) (← links)
- (Q4972736) (← links)
- (Q5014801) (← links)
- Multiple-Labelled Transition Systems for nominal calculi and their logics (Q5458061) (← links)
- A Logic for True Concurrency (Q5501929) (← links)
- (Q5856409) (← links)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5900141) (← links)
