Bisimulation for labelled Markov processes

DOI10.1006/inco.2001.2962zbMath1096.68103OpenAlexW2100893927MaRDI QIDQ2506488

Prakash Panangaden, Abbas Edalat, Josée Desharnais

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.2962

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Kantorovich functors and characteristic logics for behavioural distances, Explainability of probabilistic bisimilarity distances for labelled Markov chains, Weighted and branching bisimilarities from generalized open maps, Sound approximate and asymptotic probabilistic bisimulations for PCTL, THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES, Behavioural equivalences for continuous-time Markov processes, Equivalence checking 40 years after: a review of bisimulation tools, Approximating bisimilarity for Markov processes, Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions, Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, Approximating Labelled Markov Processes Again!, On a categorical framework for coalgebraic modal logic, A metrized duality theorem for Markov processes, A stochastic interpretation of propositional dynamic logic: expressivity, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Bisimulation for Feller-Dynkin processes, Towards a classification of behavioural equivalences in continuous-time Markov processes, Hennessy-Milner results for probabilistic PDL, The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator, On Applicative Similarity, Sequentiality, and Full Abstraction, Recursively defined metric spaces without contraction, A general SOS theory for the specification of probabilistic transition systems, Bisimulation as a logical relation, Trust evidence logic, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, A Demonic Approach to Information in Probabilistic Systems, Switched PIOA: parallel composition via distributed scheduling, Unnamed Item, Factoring stochastic relations, Eilenberg--Moore algebras for stochastic relations, Metrics for labelled Markov processes, A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems, Testing probabilistic equivalence through reinforcement learning, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Reduction semantics in Markovian process algebra, Probabilistic bisimilarity as testing equivalence, On the probabilistic bisimulation spectrum with silent moves, Unnamed Item, Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement, Expressiveness of probabilistic modal logics: a gradual approach, Behavioural equivalences for coalgebras with unobservable moves, Bisimulations for non-deterministic labelled Markov processes, Algebraic properties of stochastic effectivity functions, Approximating labelled Markov processes, Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes., Measurable stochastics for Brane calculus, Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems, Lattice properties of congruences for stochastic relations, Unnamed Item, Approximating Markov processes through filtration, Unnamed Item, Using coalgebras and the Giry monad for interpreting game logics -- a tutorial, Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, A fuzzy modal logic for fuzzy transition systems, On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context, Unnamed Item, Coalgebraic Logic over Measurable Spaces: Behavioral and Logical Equivalence, Constructive logical characterizations of bisimilarity for reactive probabilistic systems, A quantified coalgebraic van Benthem theorem, Coalgebraic logic over general measurable spaces – a survey, Modular construction of complete coalgebraic logics, Stochastic coalgebraic logic: bisimilarity and behavioral equivalence, Modular Markovian Logic, Logical characterizations of simulation and bisimulation for fuzzy transition systems, A compositional modelling and analysis framework for stochastic hybrid systems, Bisimilarity of Distributionally Equivalent Markov Transition Systems, Probabilistic Logic over Paths, A logical duality for underspecified probabilistic systems, Bisimulation relations for weighted automata, Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations, Bisimulation on Markov Processes over Arbitrary Measurable Spaces, The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata, Free Energy of Petri Nets, Bisimulation for Markov Decision Processes through Families of Functional Expressions, Random Measurable Selections, Continuous Domain Theory in Logical Form, Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes, The converse of a stochastic relation, A hierarchy of probabilistic system types, Unprovability of the logical characterization of bisimulation, Domain theory, testing and simulation for labelled Markov processes, A behavioural pseudometric for probabilistic transition systems, Bisimilarity is not Borel, Weak bisimulation is sound and complete for pCTL\(^*\), Measuring the confinement of probabilistic systems, Bisimulation and cocongruence for probabilistic systems, Final coalgebras for functors on measurable spaces, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, Analysis and control of fuzzy discrete event systems using bisimulation equivalence, Probabilistic event structures and domains, Unnamed Item, Kleisli morphisms and randomized congruences for the Giry monad, Probabilistic NetKAT, Long-term values in Markov decision processes, (co)algebraically, Simulation Hemi-metrics between Infinite-State Stochastic Games, Approximating Markov Processes by Averaging, A computable approach to measure and integration theory, Coalgebraic logic for stochastic right coalgebras, Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations, Efficient Coalgebraic Partition Refinement, Measure and probability for concurrency theorists, Model checking discounted temporal properties, A theory of stochastic systems. I: Stochastic automata, On finite-state approximants for probabilistic computation tree logic, Structural operational semantics for continuous state stochastic transition systems, Labelled Markov Processes as Generalised Stochastic Relations, Probabilistic π-Calculus and Event Structures

Uses Software

HyTech

Cites Work