scientific article; zbMATH DE number 7559464
From MaRDI portal
Publication:5089272
Cites work
- A calculus of communicating systems
- A cure for stuttering parity games
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- An O(m n) algorithm for branching bisimilarity on labelled transition systems
- An efficient algorithm to determine probabilistic bisimulation
- An On-Line Edge-Deletion Problem
- Branching time and abstraction in bisimulation semantics
- Characterizing finite Kripke structures in propositional temporal logic
- Comparative branching-time semantics for Markov chains
- Deciding orthogonal bisimulation
- Decremental strongly-connected components and single-source reachability in near-linear time
- scientific article; zbMATH DE number 177845 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- Optimal state-space lumping in Markov chains
- Polynomial time decision algorithms for probabilistic automata
- Simple O(m n) time Markov chain lumping
Cited in
(6)- Out of control: reducing probabilistic models by control-state elimination
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- On divergence-sensitive weak probabilistic bisimilarity
- Equivalence checking 40 years after: a review of bisimulation tools
- A spectrum of approximate probabilistic bisimulations
- Model checking finite-horizon Markov chains with probabilistic inference
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089272)
