Sophie Pinchinat

Stud Logica, 2019

Symbolic model checking of public announcement protocols.

[BibT_eX]

[DOI]

Tristan Charrier

J. Log. Comput., 2019

Beyond 2014: Formal Methods for Attack Tree-based Security Modeling.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2019

The Packed Interval Covering Problem is NP-complete.

[BibT_eX]

[DOI]

Abdallah Saffidine

Sébastien Lê Cong

CoRR, 2019

Reachability Games in Dynamic Epistemic Logic.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Attack Trees: A Notion of Missing Attacks.

[BibT_eX]

[DOI]

Proceedings of the Graphical Models for Security - 6th International Workshop, 2019

2018

Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus.

[BibT_eX]

[DOI]

Catalin Dima

ACM Trans. Comput. Log., 2018

Small Undecidable Problems in Epistemic Planning.

[BibT_eX]

[DOI]

Sébastien Lê Cong

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Deciding the Non-emptiness of Attack Trees.

[BibT_eX]

[DOI]

Florence Wacheux

Proceedings of the 5th International Workshop on Graphical Models for Security, 2018

Guided Design of Attack Trees: A System-Based Approach.

[BibT_eX]

[DOI]

Barbara Kordy

Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis.

[BibT_eX]

[DOI]

Gaëtan Douéneau-Tabot

Proceedings of the Advances in Modal Logic 12, 2018

2017

Preface.

[BibT_eX]

[DOI]

FLAP, 2017

Is my attack tree correct? Extended version.

[BibT_eX]

[DOI]

Barbara Kordy

CoRR, 2017

Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment.

[BibT_eX]

[DOI]

Tristan Charrier

Proceedings of the Dynamic Logic. New Trends and Applications, 2017

Is My Attack Tree Correct?

[BibT_eX]

[DOI]

Barbara Kordy

Proceedings of the Computer Security - ESORICS 2017, 2017

2016

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].

[BibT_eX]

[DOI]

Mohamadou Lamine Diouf

ARIMA J., 2016

On the Soundness of Attack Trees.

[BibT_eX]

[DOI]

Proceedings of the Graphical Models for Security - Third International Workshop, 2016

2015

The complexity of one-agent refinement modal logic.

[BibT_eX]

[DOI]

Hans van Ditmarsch

John Christopher McCabe-Dansted

Theor. Comput. Sci., 2015

Expressiveness and succinctness of a logic of robustness.

[BibT_eX]

[DOI]

Mark Reynolds

J. Appl. Non Class. Logics, 2015

Uniform strategies, rational relations and jumping automata.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2015

Games with Communication: From Belief to Preference Change.

[BibT_eX]

[DOI]

Guillaume Aucher

Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Unifying Hyper and Epistemic Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2015

ATSyRa: An Integrated Environment for Synthesizing Attack Trees - (Tool Paper).

[BibT_eX]

[DOI]

Mathieu Acher

Didier Vojtisek

Proceedings of the Graphical Models for Security - Second International Workshop, 2015

2014

Verification of gap-order constraint abstractions of counter systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A General Notion of Uniform Strategies.

[BibT_eX]

[DOI]

IGTR, 2014

Refinement modal logic.

[BibT_eX]

[DOI]

Inf. Comput., 2014

The Expressive Power of Epistemic $μ$-Calculus.

[BibT_eX]

[DOI]

Catalin Dima

CoRR, 2014

Unifying Hyper and Epistemic Temporal Logic.

[BibT_eX]

[DOI]

CoRR, 2014

Automata Techniques for Epistemic Protocol Synthesis.

[BibT_eX]

[DOI]

Guillaume Aucher

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis.

[BibT_eX]

[DOI]

Mathieu Acher

Didier Vojtisek

Proceedings of the Software Engineering and Formal Methods, 2014

2013

VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181).

[BibT_eX]

[DOI]

Alessio Lomuscio

Holger Schlingloff

Dagstuhl Reports, 2013

The Complexity of Synthesizing Uniform Strategies

[BibT_eX]

[DOI]

John Christopher McCabe-Dansted

Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

Specifying Robustness.

[BibT_eX]

[DOI]

Mark Reynolds

CoRR, 2013

Jumping Automata for Uniform Strategies.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Emptiness Of Alternating Tree Automata Using Games With Imperfect Information.

[BibT_eX]

[DOI]

Nathanaël Fijalkow

Olivier Serre

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Modal event-clock specifications for timed component-based design.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2012

Uniform Strategies

[BibT_eX]

[DOI]

CoRR, 2012

On timed alternating simulation for concurrent timed games.

[BibT_eX]

[DOI]

Axel Legay

Acta Informatica, 2012

Analysis of partially observed recursive tile systems.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

2011

Hardness of preorder checking for basic formalisms.

[BibT_eX]

[DOI]

Axel Legay

Theor. Comput. Sci., 2011

Opacity Issues in Games with Imperfect Information

[BibT_eX]

[DOI]

Proceedings of Second International Symposium on Games, 2011

2010

Future Event Logic - Axioms and Complexity.

[BibT_eX]

[DOI]

Hans van Ditmarsch

Proceedings of the Advances in Modal Logic 8, 2010

2009

Prognosis of <i>omega</i>-Languages for the Diagnosis of <i>*</i>-Languages: A Topological Perspective.

[BibT_eX]

[DOI]

Andreas Bauer

John Christopher McCabe-Dansted

Discret. Event Dyn. Syst., 2009

On the Expressivity of RoCTL*.

[BibT_eX]

[DOI]

Mark Reynolds

Proceedings of the TIME 2009, 2009

Games with Opacity Condition.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Refinement and Consistency of Timed Modal Specifications.

[BibT_eX]

[DOI]

Nathalie Bertrand

Jean-Baptiste Raclet

Proceedings of the Language and Automata Theory and Applications, 2009

Game Quantification Patterns.

[BibT_eX]

[DOI]

Dietmar Berwanger

Proceedings of the Logic and Its Applications, Third Indian Conference, 2009

A Compositional Approach on Modal Specifications for Timed Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2009

Diagnosability of Pushdown Systems.

[BibT_eX]

[DOI]

Christophe Morvan

Proceedings of the Hardware and Software: Verification and Testing, 2009

2007

Modal Specifications for the Control Theory of Discrete Event Systems.

[BibT_eX]

[DOI]

Guillaume Feuillade

Discret. Event Dyn. Syst., 2007

A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2007

2005

A decidable class of problems for control under partial observation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

On the Architectures in Decentralized Supervisory Control.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

You can always compute maximally permissive controllers under partial observation when they exist.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2005

2003

Quantified Mu-Calculus for Control Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

A Decidable Clock Language for Synchronous Specifications.

[BibT_eX]

[DOI]

Mirabelle Nebut

Proceedings of the Synchronous Languages, Applications, and Programming, 2002

2000

Supervisory control problem using symbolic bisimulation techniques.

[BibT_eX]

[DOI]

Hervé Marchand

Proceedings of the American Control Conference, 2000

1998

Intensional Approaches for Symbolic Methods.

[BibT_eX]

[DOI]

Olga Kushnarenko

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

Taxonomy and Expressiveness of Preemption: A Syntactic Approach.

[BibT_eX]

[DOI]

Éric Rutten

R. K. Shyamasundar

Proceedings of the Advances in Computing Science, 1998

1995

Translations Between Modal Logics of Reactive Systems.

[BibT_eX]

[DOI]

François Laroussinie

Philippe Schnoebelen

Theor. Comput. Sci., 1995

Preemption Primitives in Reactive Languages (A Preliminary Report).

[BibT_eX]

[DOI]

Éric Rutten

R. K. Shyamasundar

Proceedings of the Algorithms, 1995

1993

Des bisimulations pour la sémantique des systèmes réactifs. (Bisimulations for the semantics of reactive systems).

[BibT_eX]

[DOI]

PhD thesis, 1993

Translation Results for Modal Logics of Reactive Systems.

[BibT_eX]

François Laroussinie

Philippe Schnoebelen

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1991

Ordinal Processes in Comparative Concurrency Semantics.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

On the Weak Adequacy of Branching-Time Remporal Logic.

[BibT_eX]

[DOI]

Philippe Schnoebelen