Querying Fault and Attack Trees: Property Specification on a Water Network

Research output: Working paperPreprintAcademic

5 Downloads (Pure)


We provide an overview of three different query languages whose objective is to specify properties on the highly popular formalisms of fault trees (FTs) and attack trees (ATs). These are BFL, a Boolean Logic for FTs, PFL, a probabilistic extension of BFL and ATM, a logic for security metrics on ATs. We validate the framework composed by these three logics by applying them to the case study of a water distribution network. We extend the FT for this network - found in the literature - and we propose to model the system under analysis with the Fault Trees/Attack Trees (FT/ATs) formalism, combining both FTs and ATs in a unique model. Furthermore, we propose a novel combination of the showcased logics to account for queries that jointly consider both the FT and the AT of the model, integrating influences of attacks on failure probabilities of different components. Finally, we extend the domain specific language for PFL with novel constructs to capture the interplay between metrics of attacks - e.g., "cost", success probabilities - and failure probabilities in the system.
Original languageEnglish
Publication statusPublished - 29 Jan 2024


  • cs.LO


Dive into the research topics of 'Querying Fault and Attack Trees: Property Specification on a Water Network'. Together they form a unique fingerprint.

Cite this