States of Attack Under Incomplete Information

Autonomous systems are special kinds of systems that are complex, consist of many modules, different producers, different technologies like programming, machine learning, and sometimes different manufacturers. As such, checking for their properties, or even determining which state they are at a given moment, is a difficult task. To study the latter problem we use two models, originally developed in security theory, namely we combine attack trees and the information flow security. Hence a question of whether we can decide that a system has reached a given state (i.e., whether the root node of the attack tree is reached) is translated to checking current state opacity.