Pages that link to "Item:Q2734510"

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

Displaying 50 items.

• On the expressiveness of interaction (Q960859) (← links)
• On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
• An operational semantics for a calculus for wireless systems (Q964487) (← links)
• On the observational theory of the CPS-calculus (Q968276) (← links)
• Interpreting a finitary pi-calculus in differential interaction nets (Q979075) (← links)
• Type inference and strong static type checking for Promela (Q988201) (← links)
• Pict correctness revisited (Q1004056) (← links)
• Comparing communication primitives via their relative expressive power (Q1004386) (← links)
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
• An observational theory for mobile ad hoc networks (full version) (Q1012124) (← links)
• A congruence rule format for name-passing process calculi (Q1012125) (← links)
• A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
• Quantifying information leakage in process calculi (Q1023286) (← links)
• On the computational power of BlenX (Q1044845) (← links)
• A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
• Domain theory for concurrency (Q1434357) (← links)
• Mobile computation with functions (Q1612677) (← links)
• On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
• Multiparty session types, beyond duality (Q1647963) (← links)
• Virtually timed ambients: a calculus of nested virtualization (Q1683706) (← links)
• Choreographies, logically (Q1699421) (← links)
• Distinguishing between communicating transactions (Q1706141) (← links)
• A semantic theory of the Internet of things (Q1706144) (← links)
• Petri nets are dioids: a new algebraic foundation for non-deterministic net theory (Q1713413) (← links)
• Measuring security in IoT communications (Q1731516) (← links)
• Rule formats for distributivity (Q1758150) (← links)
• A type system for counting instances of software components (Q1758151) (← links)
• Secrecy and group creation (Q1763430) (← links)
• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus (Q1763728) (← links)
• On the computational strength of pure ambient calculi (Q1763730) (← links)
• A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
• An ``abstract process'' approach to algebraic dynamic architecture description (Q1779318) (← links)
• The origins of structural operational semantics (Q1878710) (← links)
• On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
• Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
• Exploring probabilistic bisimulations. I (Q1941884) (← links)
• Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
• The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
• A core model for choreographic programming (Q2007727) (← links)
• Realisability of pomsets (Q2011200) (← links)
• Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
• On the interactive power of higher-order processes extended with parameterization (Q2026374) (← links)
• \(\mathrm{HO}\pi\) in Coq (Q2031410) (← links)
• A structural approach to graph transformation based on symmetric Petri nets (Q2035652) (← links)
• A theory of monitors (Q2051767) (← links)
• Bialgebraic foundations for the operational semantics of string diagrams (Q2051792) (← links)
• Mixed sessions (Q2055956) (← links)
• Counting nondeterministic computations (Q2055958) (← links)
• A thesis for interaction (Q2055962) (← links)