The following pages link to Barbed bisimulation (Q5204357):
Displayed 45 items.
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- A coalgebraic approach to the semantics of the ambient calculus (Q860882) (← links)
- The SL synchronous language, revisited (Q864504) (← links)
- Fair testing (Q865623) (← links)
- Space-aware ambients and processes (Q875514) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- A process algebraic view of Linda coordination primitives (Q1127512) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- On performance congruences for process algebras (Q1275822) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- On bisimulations for the asynchronous \(\pi\)-calculus (Q1276246) (← links)
- Bisimulations for a calculus of broadcasting systems (Q1276256) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Basic observables for processes (Q1286368) (← links)
- On reduction-based process semantics (Q1350347) (← links)
- Bisimulation congruence of \(\chi\)-calculus (Q1398380) (← links)
- Comparing three semantics for Linda-like languages (Q1575148) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
- On the expressiveness of Linda coordination primitives. (Q1854324) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Vertical implementation (Q1854462) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- Variations on mobile processes (Q1960530) (← links)
- A synchronous \(\pi\)-calculus (Q2381508) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- Linear forwarders (Q2384926) (← links)
- Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
- Formalising Java RMI with explicit code mobility (Q2463558) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- Behavioural equivalences for dynamic web data (Q2474049) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Name-passing in an ambient-like calculus and its proof using spatial logic (Q2491641) (← links)
- The seal calculus (Q2566220) (← links)
- Bisimulation relations for dynamical, control, and hybrid systems (Q2566293) (← links)
- On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- A bisimulation for dynamic sealing (Q5899331) (← links)
- From rewrite rules to bisimulation congruences (Q5958468) (← links)
- On the semantics of durational actions (Q5958612) (← links)
- Bisimulations in the join-calculus (Q5958770) (← links)