The following pages link to A calculus of mobile processes. I (Q1198548):
Displaying 50 items.
- A calculus of mobile processes. II (Q1198549) (← links)
- An algebraic verification of a mobile network (Q1205185) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Reaction graph (Q1273068) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- On sequential composition, action prefixes and process prefix (Q1333405) (← links)
- A theory of higher order communicating systems (Q1346714) (← links)
- Verifying a distributed list system: A case history (Q1355754) (← links)
- Symmetric \(\pi\)-calculus (Q1389093) (← links)
- Bisimulation congruence of \(\chi\)-calculus (Q1398380) (← links)
- On modelling mobility (Q1575151) (← links)
- Algebraic specification of reactive systems (Q1575270) (← links)
- Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability (Q1575646) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- Proof nets, garbage, and computations (Q1589650) (← links)
- Testing congruence for mobile processes (Q1599646) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- Quantum process algebra with priorities (Q1700843) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- Binding operators for nominal sets (Q1744371) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- A coordination approach to mobile components (Q1770368) (← links)
- When ambients cannot be opened (Q1770415) (← links)
- A framework for specifying and verifying the behaviour of open systems (Q1779319) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
- Models and languages for description of parallel processes (Q1792419) (← links)
- Proof systems for message-passing process algebras (Q1815341) (← links)
- Understanding the mismatch combinator in chi calculus (Q1853614) (← links)
- Absolute versus relative time in process algebras. (Q1854325) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- Linear concurrent constraint programming: Operational and phase semantics (Q1854410) (← links)
- On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
- Modelling biochemical pathways through enhanced \(\pi\)-calculus (Q1884867) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- A formal semantics for DAI language NUML (Q1894325) (← links)
- Asynchronous communication model based on linear logic (Q1898813) (← links)
- A theory of bisimulation for the \(\pi\)-calculus (Q1901699) (← links)
- Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453) (← links)
- Variations on mobile processes (Q1960530) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus (Q1962485) (← links)
- Computing bisimulations for finite-control \(\pi\)-calculus (Q1966507) (← links)
- Inference systems for observation equivalences in the \(\pi\)-calculus (Q1974214) (← links)
- Denotational semantics of channel mobility in UTP-CSP (Q1982650) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- An axiomatization for quantum processes to unifying quantum and classical computing (Q2010952) (← links)
- Entanglement in quantum process algebra (Q2010982) (← links)
