The following pages link to Bisimulation and divergence (Q750163):
Displaying 50 items.
- A characterization of finitary bisimulation (Q287256) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- An intensional characterization of the largest bisimulation (Q580963) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- Theory of interaction (Q896903) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- Minimizing the number of transitions with respect to observation equivalence (Q1182610) (← links)
- A note on the characterization of weak bisimulation congruence in CCS (Q1184736) (← links)
- A compositional protocol verification using relativized bisimulation (Q1193593) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- A general conservative extension theorem in process algebras with inequalities (Q1391791) (← links)
- A semantic theory for value-passing processes based on the late approach (Q1398368) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Bisimulation indexes and their applications (Q1606119) (← links)
- Logics for bisimulation and divergence (Q1652984) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation (Q1878718) (← links)
- Power simulation and its relation to traces and failures refinement (Q1884900) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- Counting nondeterministic computations (Q2055958) (← links)
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence (Q2272990) (← links)
- Next-preserving branching bisimulation (Q2355689) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- Deciding orthogonal bisimulation (Q2461535) (← links)
- Axiomatising divergence (Q2581532) (← links)
- Reactive bisimulation semantics for a process algebra with timeouts (Q2687033) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- Generalized Bisimulation Metrics (Q3190107) (← links)
- Bisimulation Congruences in the Calculus of Looping Sequences (Q3525142) (← links)
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation (Q3591399) (← links)
- Bisimulation can't be traced (Q4369863) (← links)
- (Q4501684) (← links)
- (Q4619873) (← links)
- INQUISITIVE BISIMULATION (Q5000255) (← links)
- (Q5089269) (← links)
- Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. (Q5089302) (← links)
- CPO models for a class of GSOS languages (Q5096748) (← links)
- Divide and congruence III: Stability & divergence (Q5111628) (← links)
- On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS (Q5170663) (← links)
- Confluence Thanks to Extensional Determinism (Q5262976) (← links)
- Analyzing divergence in bisimulation semantics (Q5370907) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479164) (← links)
- Communicating Sequential Processes. The First 25 Years (Q5709380) (← links)
- Non-deterministic structures of computation (Q5740658) (← links)
