Pages that link to "Item:Q2734510"

The following pages link to The \(\pi\)-calculus: A theory of mobile processes (Q2734510):

Displaying 50 items.

• Processes against tests: on defining contextual equivalences (Q2079681) (← links)
• Concurrencies in reversible concurrent calculi (Q2097423) (← links)
• Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
• \( \pi\) with leftovers: a mechanisation in Agda (Q2117018) (← links)
• Eager functions as processes (Q2123050) (← links)
• On distributability (Q2123059) (← links)
• Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
• Distributability of mobile ambients (Q2216122) (← links)
• A parametric framework for reversible \(\pi\)-calculi (Q2216133) (← links)
• Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)
• Session coalgebras: a coalgebraic view on session types and communication protocols (Q2233467) (← links)
• On the relative expressiveness of higher-order session processes (Q2272988) (← links)
• Towards `up to context' reasoning about higher-order processes (Q2286742) (← links)
• Mechanized metatheory revisited (Q2323447) (← links)
• A calculus for modeling floating authorizations (Q2329444) (← links)
• A proof theory for model checking (Q2331070) (← links)
• A structural transformation from p-\(\pi\) to MSVL (Q2354315) (← links)
• Multiparty session types as coherence proofs (Q2357654) (← links)
• Similarity between preferential models (Q2368981) (← links)
• New up-to techniques for weak bisimulation (Q2373744) (← links)
• Linear forwarders (Q2384926) (← links)
• Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
• A perspective on service orchestration (Q2389337) (← links)
• Stateful applied pi calculus: observational equivalence and labelled bisimilarity (Q2397042) (← links)
• A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
• Session types revisited (Q2407105) (← links)
• Reduction semantics in Markovian process algebra (Q2413025) (← links)
• Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
• A stable non-interleaving early operational semantics for the pi-calculus (Q2423752) (← links)
• Communicating by compatibility (Q2426519) (← links)
• SOS rule formats for idempotent terms and idempotent unary operators (Q2436519) (← links)
• Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
• Open bisimulation, revisited (Q2465030) (← links)
• Behavioural equivalences for dynamic web data (Q2474049) (← links)
• Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
• Free-algebra models for the \(\pi \)-calculus (Q2474057) (← links)
• Symmetric electoral systems for ambient calculi (Q2475806) (← links)
• A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
• A typed encoding of boxed into safe ambients (Q2491209) (← links)
• Concurrent nets: a study of prefixing in process calculi (Q2491636) (← links)
• On the expressive power of \textsc{Klaim}-based calculi (Q2491638) (← links)
• A CPS encoding of name-passing in higher-order mobile embedded resources (Q2491640) (← links)
• Name-passing in an ambient-like calculus and its proof using spatial logic (Q2491641) (← links)
• A type system for lock-free processes (Q2497143) (← links)
• Mobile objects as mobile processes (Q2497145) (← links)
• Ensuring termination by typability (Q2500473) (← links)
• Elimination of quantifiers and undecidability in spatial logics for concurrency (Q2503043) (← links)
• Modelling dynamic web data (Q2566029) (← links)
• \(\pi\)-calculus with noisy channels (Q2570971) (← links)
• Communication and mobility control in boxed ambients (Q2573334) (← links)