Approximating labelled Markov processes
From MaRDI portal
Publication:1398379
DOI10.1016/S0890-5401(03)00051-8zbMath1028.68091MaRDI QIDQ1398379
Vineet Gupta, Josée Desharnais, Radha Jagadeesan, Prakash Panangaden
Publication date: 29 July 2003
Published in: Information and Computation (Search for Journal in Brave)
Related Items (33)
Approximating bisimilarity for Markov processes ⋮ Approximating Labelled Markov Processes Again! ⋮ A Duality Theorem for Real C * Algebras ⋮ Bisimulation for Feller-Dynkin processes ⋮ Comparative branching-time semantics for Markov chains ⋮ Similarity quantification for linear stochastic systems: a coupling compensator approach ⋮ Metrics for labelled Markov processes ⋮ A game-based abstraction-refinement framework for Markov decision processes ⋮ A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ On Abstraction of Probabilistic Systems ⋮ Parametric probabilistic transition systems for system design and analysis ⋮ Probabilistic bisimilarity as testing equivalence ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement ⋮ Expressiveness of probabilistic modal logics: a gradual approach ⋮ Singular value automata and approximate minimization ⋮ Unnamed Item ⋮ Approximating Markov processes through filtration ⋮ Constructive logical characterizations of bisimilarity for reactive probabilistic systems ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ Relating strong behavioral equivalences for processes with nondeterminism and probabilities ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ Bisimulation on Markov Processes over Arbitrary Measurable Spaces ⋮ TCC, with History ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Domain theory, testing and simulation for labelled Markov processes ⋮ A behavioural pseudometric for probabilistic transition systems ⋮ Bisimulation and cocongruence for probabilistic systems ⋮ Concurrency, σ-Algebras, and Probabilistic Fairness ⋮ A probabilistic calculus of cyber-physical systems ⋮ Approximating Markov Processes by Averaging ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ Proving Approximate Implementations for Probabilistic I/O Automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain theory and integration
- A probabilistic PDL
- CPO's of measures for nondeterminism
- Semantics of probabilistic programs
- Bisimulation through probabilistic testing
- Stochastic modelling of flexible manufacturing systems
- A theory of timed automata
- A logic for reasoning about time and reliability
- Composition and behaviors of probabilistic I/O automata
- HyTech: A model checker for hybrid systems
- Reactive, generative, and stratified models of probabilistic processes
- Dynamical systems, measures, and fractals via domain theory
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation for labelled Markov processes
- A domain equation for bisimulation
- Model checking of probabilistic and nondeterministic systems
- Finite Continuous Time Markov Chains
- The Category-Theoretic Solution of Recursive Domain Equations
- Spaces of maximal points
- The complexity of probabilistic verification
- An Extension Result for Continuous Valuations
- Symbolic model checking for probabilistic processes
- Probabilistic propositional temporal logics
- Testing preorders for probabilistic processes
- A Compositional Approach to Performance Modelling
- Stochastic differential equations. An introduction with applications.
This page was built for publication: Approximating labelled Markov processes
