The following pages link to A calculus of mobile processes. I (Q1198548):
Displaying 50 items.
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Subtyping for session types in the pi calculus (Q2576666) (← links)
- Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
- Comparing type systems for deadlock freedom (Q2667185) (← links)
- A process calculus for privacy-preserving protocols in location-based service systems (Q2669244) (← links)
- Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
- Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda (Q2683037) (← links)
- The \(\pi\)-calculus: A theory of mobile processes (Q2734510) (← links)
- An introduction to the \(\pi\)-calculus. (Q2760245) (← links)
- The \(\pi\)-calculus: An introduction (Q2767985) (← links)
- Declarative Programming with Algebra (Q2798283) (← links)
- On Hierarchical Communication Topologies in the $$\pi $$ -calculus (Q2802475) (← links)
- \textsf{MarCaSPiS}: a Markovian extension of a calculus for services (Q2810685) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes (Q2825420) (← links)
- Timed $$\pi $$-Calculus (Q2830030) (← links)
- On the expressive power of polyadic synchronisation in \(\pi \)-calculus (Q2842599) (← links)
- The Value-Passing Calculus (Q2842635) (← links)
- A calculus of kells (Q2844040) (← links)
- Relationally staged computations in calculi of mobile processes (Q2847810) (← links)
- From computing to interaction: on the expressiveness of asynchronous pi-calculus (Q2856009) (← links)
- A reflective higher-order calculus (Q2863844) (← links)
- Linearity, persistence and testing semantics in the asynchronous pi-calculus (Q2864372) (← links)
- Matching systems for concurrent calculi (Q2864374) (← links)
- Fair \(\pi\) (Q2866341) (← links)
- Synchrony vs asynchrony in communication primitives (Q2866346) (← links)
- Reflections on the future of concurrency theory in general and process calculi in particular (Q2870196) (← links)
- Efficient stochastic simulation of biological systems with multiple variable volumes (Q2870307) (← links)
- Language-oriented formal analysis: a case study on protocols and distributed systems (Q2870335) (← links)
- A name abstraction functor for named sets (Q2873662) (← links)
- Propositions as sessions (Q2875234) (← links)
- Weak Bisimilarity Coalgebraically (Q2888485) (← links)
- Coalgebraic Symbolic Semantics (Q2888486) (← links)
- Relating Coalgebraic Notions of Bisimulation (Q2888487) (← links)
- \(\pi\)-calculi (Q2906943) (← links)
- Mobile ambients (Q2906944) (← links)
- Families of symmetries as efficient models of resource binding (Q2919450) (← links)
- Breaking symmetries (Q2971075) (← links)
- Linked data privacy (Q2973246) (← links)
- Companions, Codensity and Causality (Q2988363) (← links)
- On Mobility and Communication (Q2994477) (← links)
- Refining Dynamics of Gene Regulatory Networks in a Stochastic π-Calculus Framework (Q3003509) (← links)
- On the Expressiveness of the π-Calculus and the Mobile Ambients (Q3067465) (← links)
- Dynamic Reactive Modules (Q3090845) (← links)
- The λ-calculus in the π-calculus (Q3094164) (← links)
- PiStache: Implementing π-Calculus in Scala (Q3098054) (← links)
- On the expressiveness of π-calculus for encoding mobile ambients (Q3130299) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- Robin Milner's Work on Concurrency (Q3178242) (← links)
- Nominal SOS (Q3178277) (← links)
