Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Spectral transforms for large boolean functions with applications to technology mapping
DAC '93 Proceedings of the 30th international Design Automation Conference
On computing the transitive closure of a state transition relation
DAC '93 Proceedings of the 30th international Design Automation Conference
A new viewpoint on two-level logic minimization
DAC '93 Proceedings of the 30th international Design Automation Conference
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Spectral Transforms for Large Boolean Functions withApplications to Technology Mapping
Formal Methods in System Design
Proceedings of the 37th Annual Design Automation Conference
The nonapproximability of OBDD minimization
Information and Computation
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Faster and Symbolic CTMC Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Advances in Model Representations
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Symbolic Methods for the State Space Exploration of GSPN Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Probabilistic decision graphs-combining verification and AI techniques for probabilistic inference
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems - New trends in probabilistic graphical models
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Data structures for symbolic multi-valued model-checking
Formal Methods in System Design
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
The octahedron abstract domain
Science of Computer Programming
Improved BDD Algorithms for the Simulation of Quantum Circuits
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
PRISM: probabilistic model checking for performance and reliability analysis
ACM SIGMETRICS Performance Evaluation Review
An algebra for fine-grained integration of XACML policies
Proceedings of the 14th ACM symposium on Access control models and technologies
Solving generalized semi-Markov decision processes using continuous phase-type distributions
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic Reasoning with Weighted and Normalized Decision Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning probabilistic decision graphs
International Journal of Approximate Reasoning
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
A symbolic algorithm for optimal Markov chain lumping
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Faster SPDL model checking through property-driven state space generation
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Data protection models for service provisioning in the cloud
Proceedings of the 15th ACM symposium on Access control models and technologies
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Analysis of privacy and security policies
IBM Journal of Research and Development
Privacy-preserving similarity measurement for access control policies
Proceedings of the 6th ACM workshop on Digital identity management
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Approximate model checking of stochastic COWS
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Lattice-valued binary decision diagrams
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
IDD-based model validation of biochemical networks
Theoretical Computer Science
Symbolic model checking of probabilistic knowledge
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Symmetry reduction for probabilistic model checking
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
GreatSPN enhanced with decision diagram data structures
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Comparison of scheduling schemes for on-demand IaaS requests
Journal of Systems and Software
On application of multi-rooted binary decision diagrams to probabilistic model checking
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
Spectrum access policy reasoning for policy-based cognitive radios
Computer Networks: The International Journal of Computer and Telecommunications Networking
Some notes on the abstraction operation for multi-terminal binary decision diagrams
Formal Methods in System Design
| Hi-index | 0.01 |
In this paper, we discuss the use of binary decisiondiagrams to represent general matrices. We demonstrate thatbinary decision diagrams are an efficient representation forevery special-case matrix in common use, notably sparsematrices. In particular, we demonstrate that for any matrix, theBDD representation can be no larger than the correspondingsparse-matrix representation. Further, the BDD representation isoften smaller than any other conventional special-caserepresentation: for the n×n Walshmatrix, for example,the BDD representation is of size O(log n). No otherspecial-case representation in common use represents this matrixin space less than O(n²). We describe termwise, row, column,block, and diagonal selection over these matrices, standard anStrassen matrix multiplication, and LU factorization. Wedemonstrate that the complexity of each of these operations overthe BDD representation is no greater than that over any standardrepresentation. Further, we demonstrate that complete pivotingis no more difficult over these matrices than partial pivoting.Finally, we consider an example, the Walsh Spectrum of a Booleanfunction.