Premium
10.2.2 Using Boolean Operators in Multiple‐Domain Matrices
Author(s) -
Maurer Maik,
GmbH Martin Strattner Teseon
Publication year - 2011
Publication title -
incose international symposium
Language(s) - English
Resource type - Journals
ISSN - 2334-5837
DOI - 10.1002/j.2334-5837.2011.tb01278.x
Subject(s) - merge (version control) , logical matrix , computer science , theoretical computer science , reduction (mathematics) , bitwise operation , matrix (chemical analysis) , domain (mathematical analysis) , algorithm , mathematics , information retrieval , programming language , mathematical analysis , chemistry , materials science , geometry , organic chemistry , composite material , group (periodic table)
Matrices are a popular method for modeling systems in complexity management. They support the accurate structural acquisition of information, and guarantee a machine readable state of data. However, with today's matrix representations, Boolean operators cannot be intuitively depicted without simplifying the system. In this paper, we present a new approach for modeling Boolean operators (AND, OR, XOR) in matrices. Boolean operators induce conditions between more than two nodes. Wherever a determination of a combination of nodes or edges is necessary, we place any of these paths in separate, superimposed matrices. The creation of instances of nodes in these superimposed matrices permits their belonging to different paths. For a better handling, this multidimensional matrix is flattened and the instances of nodes are placed side by side. In addition, we merge operators with their predecessor or successor‐node, for a size‐reduction and simplification of the matrix.