scientific article; zbMATH DE number 7559464

DOI10.4230/LIPIcs.CONCUR.2020.8MaRDI QIDQ5089272

Jan Friso Groote, David N. Jansen, Ferry Timmers, Peng-fei Yang

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov chainbehavioural equivalenceweak bisimulation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Model checking finite-horizon Markov chains with probabilistic inference, Out of control: reducing probabilistic models by control-state elimination, On divergence-sensitive weak probabilistic bisimilarity, Equivalence checking 40 years after: a review of bisimulation tools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial time decision algorithms for probabilistic automata
• Optimal state-space lumping in Markov chains
• Characterizing finite Kripke structures in propositional temporal logic
• A calculus of communicating systems
• Comparative branching-time semantics for Markov chains
• Deciding orthogonal bisimulation
• An efficient algorithm to determine probabilistic bisimulation
• A Cure for Stuttering Parity Games
• Simple O(m logn) Time Markov Chain Lumping
• An On-Line Edge-Deletion Problem
• Branching time and abstraction in bisimulation semantics
• An O(m log n) algorithm for branching bisimilarity on labelled transition systems
• Decremental strongly-connected components and single-source reachability in near-linear time
• An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation