The following pages link to (Q4223018):
Displaying 17 items.
- A model checking-based approach for security policy verification of mobile systems (Q432137) (← links)
- A process calculus for mobile ad hoc networks (Q967528) (← links)
- Typing correspondence assertions for communication protocols (Q1399972) (← links)
- On modelling mobility (Q1575151) (← links)
- Types for access control (Q1575157) (← links)
- Abstract interpretation of mobile systems (Q1772313) (← links)
- Resource access control in systems of mobile agents (Q1854507) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus (Q2566037) (← links)
- The seal calculus (Q2566220) (← links)
- On the Expressive Power of Polyadic Synchronisation in π-calculus (Q2842599) (← links)
- On Mobility and Communication (Q2994477) (← links)
- Encoding Distributed Areas and Local Communication into the π-Calculus (Q4917086) (← links)
- A Distributed π-Calculus with Local Areas of Communication (Q4921499) (← links)
- From rewrite rules to bisimulation congruences (Q5958468) (← links)
- Distributed processes and location failures (Q5958774) (← links)
