Books, proceedings,book chapters, reviews of books
Journals, Electronic Journals
International Conferences 
ArXiv, Technical and Research 
Thesis
PUBLICATIONS
|
Books, proceedings, book chapters, reviews of books |
Journals, Electronic Journals
|
International Conferences |
ArXiv, Technical and Research |
Thesis
|
Dependency Matrices for Multiplayer Strategic Dependencies
Adversarial Formal Semantics of Attack Trees and Related Problems.
Logique : fondements et applications Cours et exercices corrigés (in French).
Formula synthesis in propositional dynamic logic with shuffle
Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning (online acess)
Alternating Tree Automata with Qualitative Semantics
DEL-based Epistemic Planning: Decidability and Complexity
Library-based Attack Tree Synthesis (preprint)
DEL-based Epistemic Planning: Decidability and Complexity (pdf)
Concurrent Games in Dynamic Epistemic Logic (preprint)
Dynamic Epistemic Logic Games with Epistemic Temporal Goals (preprint)
Symbolic model checking of public announcement protocols (pdf)
Proceedings of the
26th International Symposium on Temporal Representation and Reasoning (TIME 2019), Málaga (Spain), 16th-19th October 2019.
Review of book "Temporal Logics in Computer Science: Finite-State Systems Series Number" by Demri, Goranko and Lange (Springer Nature SharedIt Initiative https://rdcu.be/bQPuV)
Attack trees: a notion of missing attacks (preprint)
Beyond 2014: Formal methods for attack tree-based security modeling (acm digital library)
The Packed Interval Covering Problem is NP-complete (pdf)
Reachability Games in Dynamic Epistemic Logic (extended version CoRR abs/1905.12422)
Relating paths in transition systems: the fall of the modal mu-calculus
Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis (preprint)
Deciding the Non-Emptiness of Attack trees (preprint)
Small undecidable problems in epistemic planning (preprint)
Guided design of attack trees: a system-based approach (preprint)
The Hintikka's world project (preprint)
Model checking against arbitrary public announcement logic: A first-order-logic prover approach for the existential fragment (preprint)
Is my attack tree correct? (preprint)
Special Issue: Tools for Teaching Logic. Volume 4, Number 1, The IfColog Journal of Logics and their Applications (FLAP). January 2017
On the Soundness of Attack Trees (preprint)
Relating paths in transition systems: the fall of the modal mu-calculus (preprint)
The Complexity of One-Agent Refinement Modal Logic (preprint)
Expressiveness and Succinctness of a Logic of Robustness (preprint)
Relating paths in transition systems: the fall of the modal mu-calculus (preprint)
Games with Communication: From Belief to Preference Change (preprint)
ATSyRa: An Integrated Environment for Synthesizing Attack Trees (preprint)
Unifying Hyper and Epistemic Temporal Logics (preprint)
Diagnosis and Opacity Problems for Infinite State Systems Modeled by Recursive Tile Systems (preprint)
Uniform Strategies, Rational Relations and Jumping Automata (preprint)
Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis
Automata Techniques for Epistemic Protocol Synthesis
Refinement Modal Logic (preprint)
Verification of gap-order constraint abstractions of counter systems (preprint)
A General Notion of Uniform Strategies (preprint)
Jumping automata for uniform strategies
Emptiness of alternating tree automata using games with imperfect information
VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181)
The complexity of one-agent Refinement Modal Logic
The Complexity of Synthesizing Uniform Strategies
Specifying Robustness
Modal event-clock specifications for timed component-based design.
The complexity of one-agent Refinement Modal Logic
Analysis of partially observed recursive tile systems
Uniform strategies
Emptiness of alternating parity tree automata using games with imperfect information
On Timed Alternating Simulation for Concurrent Timed Games
Verification of gap-order constraint abstractions of
counter systems
Hardness of preorder checking for basic formalisms
Opacity Issues in Games with Imperfect Information
Modal
event-clock specifications for timed component-based
design
Computing the winning coalitions of a turn-based game with
reachability objectives
Future event logic: axioms and complexity
Hardness of preorder checking for basic formalisms
On Timed Alternating Simulation for Concurrent Timed Games
A Compositional Approach on Modal Specifications for Timed Systems.
Games with Opacity Condition
Diagnosability of Pushdown Systems
Prognosis of
$\omega$-languages for the Diagnosis of $*$-languages: A
Topological Perspective. Andreas Bauer and
Sophie Pinchinat.
On the Expressivity of RoCTL*
Refinement and Consistency of Timed Modal Specifications
Game Quantification Patterns
A Topological Perspective on Diagnosis
Diagnosis of Pushdown Systems (Full version)
A generic constructive solution for concurrent games with
expressive constraints on strategies
Modal Specifications for the Control Theory of Discrete-Event Systems. G. Feuillade and S. Pinchinat.
Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures
A Constructive and Modular Approach to Decentralized Supervisory Control Problems
Supervision Patterns in Discrete Event Systems Diagnosis
A Constructive and Modular
Approach to Decentralized Supervisory Control Problems
On the Architectures in Decentralized Supervisory Control.
You Can Always Compute Maximally Permissive Controllers Under Partial Observation When They Exist.
Supervisory Control Problems for Nondeterministic Discrete-Event Systems: a Logical Approach.
Spécifications modales de réseaux de Petri. (in French) G. Feuillade and S. Pinchinat
A Decidable Class of Problems for Control under Partial Observation.
S. Pinchinat and S. Riedweg.
The Control of Non-deterministic Systems: a logical approach.
J-B. Raclet and S. Pinchinat.
Maximally
Permissive Controllers in All Contexts.
The Control of Non-deterministic Systems :
a logical approach. Internal Report 2004
Quantified Mu-Calculus for Control Synthesis.
Quantified Loop-mu-calculus
for
Control under Partial Observation.
A decidable clock language for synchronous specifications.
M. Nebut and S. Pinchinat.
PostscriptA decidable clock language for synchronous specifications.
with M. Nebut
A Framework to Analyse Synchronous Data-Flow Specifications. Technical Report 2002
Symbolic Abstractions of Automata.
with H. Marchand
Supervisory Control Problem using Symbolic Techniques.
with H. Marchand
Symbolic Abstractions of Automata and their application to the Supervisory Control Problem.
Intentional approaches for symbolic methods.
O. Kouchnarenko and S. Pinchinat.
Taxonomy and expressiveness of preemption : a syntactic
approach.
with E. Rutten and R.K. Shyamasundar
Intensional approaches for symbolic methods.
O. Kouchnarenko and S. Pinchinat.
Labeling Automata with Polynomials.
with O. Kouchnarenko
SOS specifications and Compositional ST-semantics.
with J.V. Echague
Preemption primitives in reactive languages (a preliminary report).
with E. Rutten and R.K. Shyamasundar
Structural Operational Semantics for True Concurrency
with J.V. Echagüe, Z. Habbas, S. Pinchinat.
Translation Results for Modal Logics of Reactive Systems.
F. Laroussinie and S. Pinchinat and Ph. Schnoebelen.
Translation Results for Modal Logics of Reactive Systems.
with F. Laroussinie and Ph. Schnoebelen.
Des Bisimulations pour la Sémantique des Systèmes Réactifs
On the Weak Adequacy of Branching-Time Remporal Logic