Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
DOI10.1007/S10703-010-0095-8zbMATH Open1214.68219OpenAlexW2047151442MaRDI QIDQ600975FDOQ600975
Authors: Kai Lampka, Markus Siegle, Jörn Ossowski, Christel Baier 
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
Recommendations
binary decision diagrams and their algorithmsquantitative verification of systemssymbolic data structures for performance analysis
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)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Branching Programs and Binary Decision Diagrams
- Title not available (Why is that?)
- Title not available (Why is that?)
- Binary Decision Diagrams
- Zero-suppressed BDDs and their applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Exploiting interleaving semantics in symbolic state-space generation
- Title not available (Why is that?)
- Validation of Stochastic Systems
Cited In (1)
Uses Software
This page was built for publication: Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600975)
