A new algorithm for partitioned symbolic reachability analysis

DOI10.1016/J.ENTCS.2008.12.036zbMATH Open1337.68167OpenAlexW2070869652MaRDI QIDQ4982091FDOQ4982091

Authors: Kai Lampka 

Publication date: 23 March 2015

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.036

Recommendations

• scientific article; zbMATH DE number 1629965
• Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
• Validation of Stochastic Systems
• Automated Technology for Verification and Analysis
• Approximate Symbolic Reachability of Networks of Transition Systems

zbMATH Keywords

binary decision diagramsquantitative verification of systemssymbolic reachability analysis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• Title not available (Why is that?)
• Binary Decision Diagrams
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multi-terminal binary decision diagrams
• Pascal's Prism
• Title not available (Why is that?)

Cited In (5)

• Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications
• Partitioning of algebraic subexpressions in computer algebra systems: an alternative to matching with an application to symbolic integration
• Formal Methods in Computer-Aided Design
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems

Uses Software

• PRISM
• CASPA

This page was built for publication: A new algorithm for partitioned symbolic reachability analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982091)