Bisimulation minimization and symbolic model checking
From MaRDI portal
Recommendations
- A parallel relation-based algorithm for symbolic bisimulation minimization
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- SMT-based bisimulation minimisation of Markov models
- Partial-order reduction in symbolic state-space exploration
- Minimization Algorithm for Symbolic Bisimilarity
Cited in
(18)- Partition refinement of component interaction automata
- A parallel relation-based algorithm for symbolic bisimulation minimization
- Generating BDDs for symbolic model checking in CCS
- Symbolic graphs: Linear solutions to connectivity related problems
- Branching vs. Linear Time: Semantical Perspective
- Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- scientific article; zbMATH DE number 7455737 (Why is no real title available?)
- Minimal transition systems for history-preserving bisimulation
- Statistical model checking of stochastic component-based systems
- Efficient Coalgebraic Partition Refinement
- Efficient and modular coalgebraic partition refinement
- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
- On divergence-sensitive weak probabilistic bisimilarity
- Equivalence checking 40 years after: a review of bisimulation tools
- Minimisation of spatial models using branching bisimilarity
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- The reachable simulation problem
This page was built for publication: Bisimulation minimization and symbolic model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698435)