scientific article; zbMATH DE number 1361128
From MaRDI portal
Publication:4270063
Recommendations
Cited in
(58)- Characterize branching distance in terms of ( , )-bisimilarity
- Approximating labelled Markov processes
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Learning deterministic probabilistic automata from a model checking perspective
- Domain theory, testing and simulation for labelled Markov processes
- A behavioural pseudometric for probabilistic transition systems
- A brief history of process algebra
- On the metric-based approximate minimization of Markov chains
- De Bakker-Zucker processes revisited
- Bisimulation metrics and norms for real-weighted automata
- A complete axiomatization of weighted branching bisimulation
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Recursively defined metric spaces without contraction
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Bisimulation and cocongruence for probabilistic systems
- Approximating and computing behavioural distances in probabilistic transition systems
- \(\pi\)-calculus with noisy channels
- On finite-state approximants for probabilistic computation tree logic
- A metrized duality theorem for Markov processes
- Labelled Markov processes as generalised stochastic relations
- On equivalences, metrics, and polynomial time
- Metric reasoning about -terms: the general case
- Symbolic model checking in non-Boolean domains
- A Formal Framework for User Centric Control of Probabilistic Multi-agent Cyber-Physical Systems
- A pseudometric in supervisory control of probabilistic discrete event systems
- EQUIVALENCE OF LABELED MARKOV CHAINS
- Labelled Markov processes.
- Converging from branching to linear metrics on Markov chains
- On behavioural pseudometrics and closure ordinals
- Extending set functors to generalised metric spaces
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
- Expressive logics for coinductive predicates
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Differential privacy in probabilistic systems
- A behavioural pseudometric based on -bisimilarity
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Bisimulation for Markov decision processes through families of functional expressions
- Measuring and synthesizing systems in probabilistic environments
- Measuring the confinement of probabilistic systems
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Metrics for labelled Markov processes
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Sound approximate and asymptotic probabilistic bisimulations for PCTL
- Structure in machine learning
- Comparing labelled Markov decision processes
- A spectrum of approximate probabilistic bisimulations
- Minimising the probabilistic bisimilarity distance
- A behavioural pseudometric for continuous-time Markov processes
- A cancellation law for probabilistic processes
- Contextual behavioural metrics
- The Kantorovich metric in computer science: a brief survey
- Universal quantitative algebra for fuzzy relations and generalised metric spaces
- The probabilistic powerdomain for stably compact spaces
- Quantitative analysis of weighted transition systems
- Quantitative monoidal algebra: axiomatising distance with string diagrams
- Explainability is a game for probabilistic bisimilarity distances
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4270063)
