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 processesApproximating Labelled Markov Processes Again!A Duality Theorem for Real C * AlgebrasBisimulation for Feller-Dynkin processesComparative branching-time semantics for Markov chainsSimilarity quantification for linear stochastic systems: a coupling compensator approachMetrics for labelled Markov processesA game-based abstraction-refinement framework for Markov decision processesA Theory for the Semantics of Stochastic and Non-deterministic Continuous SystemsOn Abstraction of Probabilistic SystemsParametric probabilistic transition systems for system design and analysisProbabilistic bisimilarity as testing equivalence\textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semanticsVerification of General Markov Decision Processes by Approximate Similarity Relations and Policy RefinementExpressiveness of probabilistic modal logics: a gradual approachSingular value automata and approximate minimizationUnnamed ItemApproximating Markov processes through filtrationConstructive logical characterizations of bisimilarity for reactive probabilistic systemsLogical characterizations of simulation and bisimulation for fuzzy transition systemsRelating strong behavioral equivalences for processes with nondeterminism and probabilitiesProbabilistic Model Checking of Labelled Markov Processes via Finite Approximate BisimulationsBisimulation on Markov Processes over Arbitrary Measurable SpacesTCC, with HistoryRevisiting bisimilarity and its modal logic for nondeterministic and probabilistic processesDomain theory, testing and simulation for labelled Markov processesA behavioural pseudometric for probabilistic transition systemsBisimulation and cocongruence for probabilistic systemsConcurrency, σ-Algebras, and Probabilistic FairnessA probabilistic calculus of cyber-physical systemsApproximating Markov Processes by AveragingLabelled Markov Processes as Generalised Stochastic RelationsProving Approximate Implementations for Probabilistic I/O Automata


Uses Software


Cites Work


This page was built for publication: Approximating labelled Markov processes