On behavioural pseudometrics and closure ordinals
From MaRDI portal
(Redirected from Publication:456100)
Recommendations
Cites work
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- scientific article; zbMATH DE number 1864592 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- Approximate reasoning for real-time probabilistic processes
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- Automata, Languages and Programming
- Bisimulation through probabilistic testing
- Game Refinement Relations and Metrics
- Perturbations of positive semigroups with applications
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
Cited in
(10)- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- A probabilistic calculus of cyber-physical systems
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- SOS specifications for uniformly continuous operators
- Computing probabilistic bisimilarity distances for probabilistic automata
- Computing bisimilarity metrics for probabilistic timed automata
This page was built for publication: On behavioural pseudometrics and closure ordinals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456100)