The following pages link to (Q3929062):
Displaying 50 items.
- A characterization of finitary bisimulation (Q287256) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- More on bisimulations for higher order \(\pi\)-calculus (Q442289) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Refusal testing (Q580961) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- Late and early semantics coincide for testing (Q673146) (← links)
- Translations between modal logics of reactive systems (Q674003) (← links)
- Graphical versus logical specifications (Q685358) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Bisimulation and divergence (Q750163) (← links)
- A logical characterization of observation equivalence (Q802306) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Theory of interaction (Q896903) (← links)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion (Q912592) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- The compression structure of a process (Q1044743) (← links)
- A proof-theoretic characterization of observational equivalence (Q1060006) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Bisimulation through probabilistic testing (Q1175940) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- A compositional protocol verification using relativized bisimulation (Q1193593) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Structured operational semantics and bisimulation as a congruence (Q1198952) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- On transformations of concurrent-object programs (Q1276245) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity (Q1680509) (← links)
- Corrigendum: ``A domain equation for bisimulation'' by S. Abramsky (Q1854414) (← 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)
- Branching time and orthogonal bisimulation equivalence (Q1884905) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
- Rooted branching bisimulation as a congruence (Q1975965) (← links)
- Agreement between conformance and composition (Q2017761) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Compositionality of Hennessy-Milner logic by structural operational semantics (Q2368979) (← links)
- Axiomatizing weak simulation semantics over BCCSP (Q2453533) (← links)
- Deciding orthogonal bisimulation (Q2461535) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Axiomatizing Weak Ready Simulation Semantics over BCCSP (Q3105742) (← links)
- CPO models for a class of GSOS languages (Q5096748) (← links)
