SMT-Based Bisimulation Minimisation of Markov Models

DOI10.1007/978-3-642-35873-9_5zbMath1426.68168OpenAlexW100229751WikidataQ57801023 ScholiaQ57801023MaRDI QIDQ2926637

No author found.

Publication date: 3 November 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35873-9_5

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

An efficient algorithm to determine probabilistic bisimulation ⋮ Out of control: reducing probabilistic models by control-state elimination ⋮ On Abstraction of Probabilistic Systems ⋮ Statistical model checking of stochastic component-based systems ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Symbolic computation of differential equivalences ⋮ Quantitative Abstractions for Collective Adaptive Systems

Uses Software

• SIGREF
• PRISM
• PVS
• CEGAR

This page was built for publication: SMT-Based Bisimulation Minimisation of Markov Models