Impossible futures and determinism
From MaRDI portal
Cites work
Cited in
(16)- Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
- Free choice impossibility results
- Coupled similarity: the first 32 years
- Axiomatizing weak simulation semantics over BCCSP
- A general approach to comparing infinite-state systems with their finite-state specifications
- On the unification of process semantics: equational semantics
- Axiomatizing weak ready simulation semantics over BCCSP
- A Context-Free Process as a Pushdown Automaton
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
- On the Unification of Process Semantics: Observational Semantics
- Trace- and failure-based semantics for responsiveness
- Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
- Characterizing contrasimilarity through games, modal logic, and complexity
- A game characterization for contrasimilarity
- Coupled Similarity and Contrasimilarity, and How to Compute Them
- Fair testing
This page was built for publication: Impossible futures and determinism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607117)