Rank-Based Symbolic Bisimulation

DOI10.1016/S1571-0661(04)80547-4zbMath1261.68084OpenAlexW1599684339MaRDI QIDQ4916208

Agostino Dovier, Alberto Policriti, Carla Piazza, Raffaella Gentilini

Publication date: 19 April 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80547-4

zbMATH Keywords

ordered binary decision diagramsmodel checkingbisimulationsymbolic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

An efficient algorithm for computing bisimulation equivalence, Equivalence checking 40 years after: a review of bisimulation tools

Uses Software

• CUDD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time solution to the single function coarsest partition problem
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Graph-Based Algorithms for Boolean Function Manipulation
• Three Partition Refinement Algorithms
• Binary Decision Diagrams
• Depth-First Search and Linear Graph Algorithms