Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
| Hi-index | 0.00 |
The starting point of this work are inaccurate statements found in the literature for Multi-terminal Binary Decision Diagrams (MTBDDs) (Bahar et al., Form. Methods Syst. Des. 10(2/3):171---206, 1997; Siegle, Behaviour analysis of communication systems: compositional modelling, compact representation and analysis of performability properties, 2002; Kuntz, Symbolic semantics and verification of stochastic process algebras, 2006) regarding the well-definedness of the MTBDD abstraction operation. The statements try to relate an operation 驴 on a set of terminal values M to the property that the abstraction over this operation does depend on the order of the abstracted variables. This paper gives a necessary and sufficient condition for the independence of the abstraction operation of the order of the abstracted variables in the case of an underlying monoid and it treats the more general setting of a magma.