Approximating labelled Markov processes
From MaRDI portal
Publication:1398379
DOI10.1016/S0890-5401(03)00051-8zbMATH Open1028.68091MaRDI QIDQ1398379FDOQ1398379
Authors: Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden 
Publication date: 29 July 2003
Published in: Information and Computation (Search for Journal in Brave)
Recommendations
Cites Work
- HyTech: A model checker for hybrid systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of timed automata
- The complexity of probabilistic verification
- Bisimulation for labelled Markov processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Spaces of maximal points
- An Extension Result for Continuous Valuations
- Stochastic differential equations. An introduction with applications.
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Model checking of probabilistic and nondeterministic systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Compositional Approach to Performance Modelling
- A probabilistic PDL
- Title not available (Why is that?)
- Domain theory and integration
- A domain equation for bisimulation
- Reactive, generative, and stratified models of probabilistic processes
- Symbolic model checking for probabilistic processes
- Semantics of probabilistic programs
- Finite Continuous Time Markov Chains
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Stochastic modelling of flexible manufacturing systems
- Dynamical systems, measures, and fractals via domain theory
- Probabilistic propositional temporal logics
- CPO's of measures for nondeterminism
- Testing preorders for probabilistic processes
- Composition and behaviors of probabilistic I/O automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (41)
- A Duality Theorem for Real C * Algebras
- Hyperfinite Approximations to Labeled Markov Transition Systems
- Approximating bisimilarity for Markov processes
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Parametric probabilistic transition systems for system design and analysis
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Approximating Markov processes through filtration
- Probabilistic bisimilarity as testing equivalence
- On Abstraction of Probabilistic Systems
- Approximating Markov Processes by Averaging
- Bisimulation on Markov processes over arbitrary measurable spaces
- Metrics for labelled Markov processes
- Approximating Markov processes by averaging
- Bisimulation for Feller-Dynkin processes
- Singular value automata and approximate minimization
- Domain theory, testing and simulation for labelled Markov processes
- A probabilistic calculus of cyber-physical systems
- Concurrency, σ-Algebras, and Probabilistic Fairness
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- A game-based abstraction-refinement framework for Markov decision processes
- Expressiveness of probabilistic modal logics: a gradual approach
- (Towards a) statistical probabilistic lazy lambda calculus
- Approximating labelled Markov processes again!
- Conditional expectation and the approximation of labelled Markov processes.
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Proving approximate implementations for probabilistic I/O automata
- Labelled Markov processes.
- TCC, with history
- Taking it to the limit: approximate reasoning for Markov processes
- Bisimulation and cocongruence for probabilistic systems
- Verification of general Markov decision processes by approximate similarity relations and policy refinement
- Similarity quantification for linear stochastic systems: a coupling compensator approach
- Some properties of stochastic labeling procedures
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Comparative branching-time semantics for Markov chains
- Bisimulations for probabilistic and quantum processes (invited paper)
- Labelled Markov processes as generalised stochastic relations
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Labelled Markov processes: stronger and faster approximations
- A behavioural pseudometric for probabilistic transition systems
Uses Software
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)
