Approximating labelled Markov processes
From MaRDI portal
Publication:1398379
Recommendations
Cites work
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 4083878 (Why is no real title available?)
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3615887 (Why is no real title available?)
- scientific article; zbMATH DE number 1361121 (Why is no real title available?)
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- scientific article; zbMATH DE number 1754609 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A Compositional Approach to Performance Modelling
- A domain equation for bisimulation
- A logic for reasoning about time and reliability
- A probabilistic PDL
- A theory of timed automata
- An Extension Result for Continuous Valuations
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Bisimulation for labelled Markov processes
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation through probabilistic testing
- CPO's of measures for nondeterminism
- Composition and behaviors of probabilistic I/O automata
- Domain theory and integration
- Dynamical systems, measures, and fractals via domain theory
- Finite Continuous Time Markov Chains
- HyTech: A model checker for hybrid systems
- Model checking of probabilistic and nondeterministic systems
- Probabilistic propositional temporal logics
- Reactive, generative, and stratified models of probabilistic processes
- Semantics of probabilistic programs
- Spaces of maximal points
- Stochastic differential equations. An introduction with applications.
- Stochastic modelling of flexible manufacturing systems
- Symbolic model checking for probabilistic processes
- Testing preorders for probabilistic processes
- The Category-Theoretic Solution of Recursive Domain Equations
- The complexity of probabilistic verification
Cited in
(42)- Comparative branching-time semantics for Markov chains
- Hyperfinite Approximations to Labeled Markov Transition Systems
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- On Abstraction of Probabilistic Systems
- (Towards a) statistical probabilistic lazy lambda calculus
- Proving approximate implementations for probabilistic I/O automata
- Approximating Markov processes through filtration
- Labelled Markov processes: stronger and faster approximations
- A probabilistic calculus of cyber-physical systems
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Finite Approximation of LMPs for Exact Verification of Reachability Properties
- Bisimulation for Feller-Dynkin processes
- Approximating labelled Markov processes again!
- Taking it to the limit: approximate reasoning for Markov processes
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Approximating Markov Processes by Averaging
- Conditional expectation and the approximation of labelled Markov processes.
- Metrics for labelled Markov processes
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Parametric probabilistic transition systems for system design and analysis
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- A Duality Theorem for Real C * Algebras
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Labelled Markov processes.
- Singular value automata and approximate minimization
- Bisimulation on Markov processes over arbitrary measurable spaces
- Bisimulation and cocongruence for probabilistic systems
- A behavioural pseudometric for probabilistic transition systems
- Some properties of stochastic labeling procedures
- Approximating bisimilarity for Markov processes
- Expressiveness of probabilistic modal logics: a gradual approach
- Domain theory, testing and simulation for labelled Markov processes
- Bisimulations for probabilistic and quantum processes (invited paper)
- Probabilistic bisimilarity as testing equivalence
- Labelled Markov processes as generalised stochastic relations
- Concurrency, σ-Algebras, and Probabilistic Fairness
- TCC, with history
- Similarity quantification for linear stochastic systems: a coupling compensator approach
- A game-based abstraction-refinement framework for Markov decision processes
- Approximating Markov processes by averaging
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
This page was built for publication: Approximating labelled Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398379)
