The following pages link to (Q3662610):
Displaying 14 items.
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
- Typing access control and secure information flow in sessions (Q462485) (← links)
- Refusal testing (Q580961) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- (Bi)simulations up-to characterise process semantics (Q1012122) (← links)
- Axiomatising finite delay operators (Q1055190) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- A proof-theoretic characterization of observational equivalence (Q1060006) (← links)
- On powerdomains and modality (Q1067409) (← links)
- Synchronization trees (Q1348524) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Simulations Up-to and Canonical Preorders (Q2871827) (← links)
- General Refinement, Part One: Interfaces, Determinism and Special Refinement (Q5403470) (← links)
