Rank-based symbolic bisimulation: (and model checking)
From MaRDI portal
Recommendations
Cites work
- A linear time solution to the single function coarsest partition problem
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Binary Decision Diagrams
- Depth-First Search and Linear Graph Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 177515 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1796125 (Why is no real title available?)
- scientific article; zbMATH DE number 1390338 (Why is no real title available?)
- Three Partition Refinement Algorithms
Cited in
(5)
This page was built for publication: Rank-based symbolic bisimulation: (and model checking)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916208)