The following pages link to Barbed bisimulation (Q5204357):
Displaying 50 items.
- Name-passing calculi: from fusions to preorders and types (Q342734) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Processes in space (Q418828) (← links)
- A calculus of trustworthy ad hoc networks (Q470043) (← links)
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- A timed calculus for wireless systems (Q650891) (← links)
- Extensional Petri net (Q667521) (← links)
- Reactive systems, (semi-)saturated semantics and coalgebras on presheaves (Q843097) (← 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)
- Theory of interaction (Q896903) (← links)
- CSP is a retract of CCS (Q960852) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- Mobility control via passports (Q1012123) (← links)
- An observational theory for mobile ad hoc networks (full version) (Q1012124) (← 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)
- Virtually timed ambients: a calculus of nested virtualization (Q1683706) (← links)
- A semantic theory of the Internet of things (Q1706144) (← 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 process algebraic approach to reaction systems (Q2044947) (← links)
- Mixed sessions (Q2055956) (← links)
- Counting nondeterministic computations (Q2055958) (← links)
- A thesis for interaction (Q2055962) (← links)
- Categorical specification and implementation of replicated data types (Q2072069) (← links)
