Polynomial logical zonotopes introduce a set representation for efficient reachability analysis in logical systems. They support all fundamental logical operations exactly, with a slight increase in computational complexity compared to logical zonotopes. The content discusses the motivation behind polynomial logical zonotopes, their construction, and their application in reachability analysis. It also compares them with traditional logical zonotopes and highlights the computational trade-offs between the two representations.
Naar een andere taal
vanuit de broninhoud
arxiv.org
Belangrijkste Inzichten Gedestilleerd Uit
by Amr Alanwar,... om arxiv.org 03-05-2024
https://arxiv.org/pdf/2306.12508.pdfDiepere vragen