( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Attack Trees: A Notion of Missing Attacks.

, , , и . GraMSec@CSF, том 11720 из Lecture Notes in Computer Science, стр. 23-49. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sophie Pinchinat

Sophie Scaruppe

Sophie Schetke

Sophie Schäfer

Sophie Romberg

 

Другие публикации лиц с тем же именем

Adversarial Formal Semantics of Attack Trees and Related Problems., , и . GandALF, том 370 из EPTCS, стр. 162-177. (2022)Supervisory control problem using symbolic bisimulation techniques., и . ACC, стр. 4067-4071. IEEE, (2000)Concurrent Games in Dynamic Epistemic Logic., , , и . IJCAI, стр. 1877-1883. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..You can always compute maximally permissive controllers under partial observation when they exist., и . ACC, стр. 2287-2292. IEEE, (2005)Deciding the Non-emptiness of Attack Trees., , , и . GraMSec@FLoC, том 11086 из Lecture Notes in Computer Science, стр. 13-30. Springer, (2018)Alternating Tree Automata with Qualitative Semantics., , , , , , , , , и . ACM Trans. Comput. Log., 22 (1): 7:1-7:24 (2021)Strategic Reasoning Under Imperfect Information with Synchronous Semantics (Invited Talk).. TIME, том 318 из LIPIcs, стр. 2:1-2:2. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The Expressive Power of Epistemic $μ$-Calculus., , и . CoRR, (2014)Attack Trees: A Notion of Missing Attacks., , , и . GraMSec@CSF, том 11720 из Lecture Notes in Computer Science, стр. 23-49. Springer, (2019)Complexity of Opacity algorithm in data-centric workflow system Complexité de l'algorithme de l'opacité dans les systèmes Workflows centrés sur les documents., и . ARIMA J., (2016)