SwePub - search: id:"swepub:oai:DiVA.org:kth-34...

Enumeration	Reference	Cover	Find
1.	Alanwar, Amr, et al. (author) Logical Zonotopes : A Set Representation for the Formal Verification of Boolean Functions 2023 In: 2023 62nd IEEE Conference on Decision and Control, CDC 2023. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 60-66 Conference paper (peer-reviewed)abstract A logical zonotope, which is a new set representation for binary vectors, is introduced in this paper. A logical zonotope is constructed by XORing a binary vector with a combination of other binary vectors called generators. Such a zonotope can represent up to 2γ binary vectors using only γ generators. It is shown that logical operations over sets of binary vectors can be performed on the zonotopes' generators and, thus, significantly reduce the computational complexity of various logical operations (e.g., XOR, NAND, AND, OR, and semi-tensor products). Similar to traditional zonotopes' role in the formal verification of dynamical systems over real vector spaces, logical zonotopes can efficiently analyze discrete dynamical systems defined over binary vector spaces. We illustrate the approach and its ability to reduce the computational complexity in two use cases: (1) encryption key discovery of a linear feedback shift register and (2) safety verification of a road traffic intersection protocol.

Alanwar, Amr, et al. (author)
Logical Zonotopes : A Set Representation for the Formal Verification of Boolean Functions
2023
In: 2023 62nd IEEE Conference on Decision and Control, CDC 2023. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 60-66
Conference paper (peer-reviewed)abstract
- A logical zonotope, which is a new set representation for binary vectors, is introduced in this paper. A logical zonotope is constructed by XORing a binary vector with a combination of other binary vectors called generators. Such a zonotope can represent up to 2γ binary vectors using only γ generators. It is shown that logical operations over sets of binary vectors can be performed on the zonotopes' generators and, thus, significantly reduce the computational complexity of various logical operations (e.g., XOR, NAND, AND, OR, and semi-tensor products). Similar to traditional zonotopes' role in the formal verification of dynamical systems over real vector spaces, logical zonotopes can efficiently analyze discrete dynamical systems defined over binary vector spaces. We illustrate the approach and its ability to reduce the computational complexity in two use cases: (1) encryption key discovery of a linear feedback shift register and (2) safety verification of a road traffic intersection protocol.

Träfflista för sökning "id:"swepub:oai:DiVA.org:kth-343723" "