Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications

DOI10.1007/S10703-010-0095-8zbMath1214.68219OpenAlexW2047151442MaRDI QIDQ600975

Christel Baier, Joern Ossowski, Markus Siegle, Kai Lampka

Publication date: 3 November 2010

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/22325

zbMATH Keywords

binary decision diagrams and their algorithmsquantitative verification of systemssymbolic data structures for performance analysis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Extracting co-occurrence relations from ZDDs

Uses Software

• PRISM
• CASPA
• CUDD

Cites Work

• On the use of MTBDDs for performability analysis and verification of stochastic systems.
• Zero-suppressed BDDs and their applications
• Exploiting interleaving semantics in symbolic state-space generation
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• Branching Programs and Binary Decision Diagrams
• Validation of Stochastic Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications