Pages that link to "Item:Q2734510"
From MaRDI portal
The following pages link to The \(\pi\)-calculus: A theory of mobile processes (Q2734510):
Displaying 50 items.
- Subtyping Supports Safe Session Substitution (Q3188281) (← links)
- Up-to Techniques for Branching Bisimilarity (Q3297777) (← links)
- (Q3384917) (← links)
- MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI (Q3444848) (← links)
- A Behavioural Theory for a π-calculus with Preorders (Q3455864) (← links)
- Complete Lattices and Up-To Techniques (Q3498446) (← links)
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence (Q3498448) (← links)
- On Beta-Binders Communications (Q3507381) (← links)
- On Recursion, Replication and Scope Mechanisms in Process Calculi (Q3525112) (← links)
- Bounded polymorphism in session types (Q3535678) (← links)
- Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol (Q3540086) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of π-Calculus Processes (Q3582736) (← links)
- Security Types for Dynamic Web Data (Q3608462) (← links)
- Normal Bisimulations in Calculi with Passivation (Q3617734) (← links)
- Partial Orders, Event Structures and Linear Strategies (Q3637188) (← links)
- A Process-Model for Linear Programs (Q3638259) (← links)
- (Q4248252) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
- (Q4972733) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- A universal session type for untyped asynchronous communication (Q5009447) (← links)
- (Q5013873) (← links)
- (Q5015357) (← links)
- (Q5015359) (← links)
- (Q5020947) (← links)
- Mixed Sessions (Q5041119) (← links)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages (Q5043601) (← links)
- (Q5101336) (← links)
- (Q5101343) (← links)
- Parameterizing higher-order processes on names and processes (Q5108373) (← links)
- Coverability Synthesis in Parametric Petri Nets (Q5111622) (← links)
- (Q5111623) (← links)
- (Q5111635) (← links)
- (Q5155688) (← links)
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus (Q5162607) (← links)
- Counting the Cost in the Picalculus (Extended Abstract) (Q5166616) (← links)
- Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
- Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks (Q5179206) (← links)
- Divergence and unique solution of equations (Q5228882) (← links)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- Observing Success in the Pi-Calculus (Q5240185) (← links)
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (Q5262945) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- Equations, Contractions, and Unique Solutions (Q5278202) (← links)
- (Q5377471) (← links)
- A Translation of Beta-binders in a Prioritized Pi-calculus (Q5404078) (← links)
- Pict Correctness Revisited (Q5428913) (← links)