Sophie Pinchinat

96 papers A* 5A 3B 10C 7Journal 36Unranked 34

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Cat Herding Game Played on Infinite Trees. FSTTCS Rylo Ashmore, Sophie Pinchinat
2025	—	`conf`	Propositional Dynamic Logic Formula Synthesis and Some Applications. ICLA Sophie Pinchinat
2024	—	`conf`	Plan Logic. FSTTCS Dylan Bellier, Massimo Benerecetti, Fabio Mogavero, Sophie Pinchinat
2024	—	`conf`	Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. LATIN (2) Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2024	C	`conf`	Strategic Reasoning Under Imperfect Information with Synchronous Semantics (Invited Talk). TIME Sophie Pinchinat
2023	J	`jnl`	Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages. CoRR Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2023	—	`conf`	Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque. CNIA Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2022	B	`ed.`	Advances in Modal Logic, AiML 2022, Rennes, France, August 22-25, 2022. AiML David Fernández-Duque, Alessandra Palmigiano, Sophie Pinchinat
2022	—	`conf`	Adversarial Formal Semantics of Attack Trees and Related Problems. GandALF Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
2022	—	`conf`	Dependency Matrices for Multiplayer Strategic Dependencies. FSTTCS Dylan Bellier, Sophie Pinchinat, François Schwarzentruber
2022	A*	`conf`	Formula Synthesis in Propositional Dynamic Logic with Shuffle. AAAI Sophie Pinchinat, Sasha Rubin, François Schwarzentruber
2022	J	`jnl`	On the Role of Postconditions in Dynamic First-Order Epistemic Logic. CoRR Côme Neyrand, Sophie Pinchinat
2021	J	`jnl`	Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
2021	J	`jnl`	Special Issue - Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning. Inf. Comput. Johann Gamper, Sophie Pinchinat, Guido Sciavicco
2020	J	`jnl`	Alternating Tree Automata with Qualitative Semantics. CoRR Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
2020	A*	`conf`	Concurrent Games in Dynamic Epistemic Logic. IJCAI Bastien Maubert, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri
2020	J	`jnl`	DEL-based epistemic planning: Decidability and complexity. Artif. Intell. Thomas Bolander, Tristan Charrier, Sophie Pinchinat, François Schwarzentruber
2020	A	`conf`	Dynamic Epistemic Logic Games with Epistemic Temporal Goals. ECAI Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri
2020	J	`jnl`	Dynamic Epistemic Logic Games with Epistemic Temporal Goals. CoRR Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri
2020	—	`conf`	Library-Based Attack Tree Synthesis. GraMSec Sophie Pinchinat, François Schwarzentruber, Sébastien Lê Cong
2019	C	`ed.`	26th International Symposium on Temporal Representation and Reasoning, TIME 2019, Málaga, Spain, October 16-19, 2019 TIME Johann Gamper, Sophie Pinchinat, Guido Sciavicco
2019	—	`conf`	Attack Trees: A Notion of Missing Attacks. GraMSec Sophie Pinchinat, Barbara Fila, Florence Wacheux, Yann Thierry-Mieg
2019	J	`jnl`	Beyond 2014: Formal Methods for Attack Tree-based Security Modeling. ACM Comput. Surv. Wojciech Widel, Maxime Audinot, Barbara Fila, Sophie Pinchinat
2019	A*	`conf`	Reachability Games in Dynamic Epistemic Logic. IJCAI Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
2019	J	`jnl`	Reachability Games in Dynamic Epistemic Logic. CoRR Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
2019	J	`jnl`	S. Demri, V. Goranko, M. Lange, Temporal Logics in Computer Science - Finite-State Systems - Cambridge University Press 2016, pp. 752. ISBN-10: 1107028361 (hardcover) £90.00; ISBN-13: 978-1107028364; online ISBN: 978-1139236119 (kindle) £85.50. Stud Logica Sophie Pinchinat
2019	J	`jnl`	Symbolic model checking of public announcement protocols. J. Log. Comput. Tristan Charrier, Sophie Pinchinat, François Schwarzentruber
2019	J	`jnl`	The Packed Interval Covering Problem is NP-complete. CoRR Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber
2018	B	`conf`	Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis. Advances in Modal Logic Gaëtan Douéneau-Tabot, Sophie Pinchinat, François Schwarzentruber
2018	—	`conf`	Deciding the Non-emptiness of Attack Trees. GraMSec Maxime Audinot, Sophie Pinchinat, François Schwarzentruber, Florence Wacheux
2018	A	`conf`	Guided Design of Attack Trees: A System-Based Approach. CSF Maxime Audinot, Sophie Pinchinat, Barbara Kordy
2018	J	`jnl`	Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Trans. Comput. Log. Catalin Dima, Bastien Maubert, Sophie Pinchinat
2018	A*	`conf`	Small Undecidable Problems in Epistemic Planning. IJCAI Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber
2017	—	`conf`	Is My Attack Tree Correct? ESORICS (1) Maxime Audinot, Sophie Pinchinat, Barbara Kordy
2017	J	`jnl`	Is my attack tree correct? Extended version. CoRR Maxime Audinot, Sophie Pinchinat, Barbara Kordy
2017	—	`conf`	Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment. DALI@TABLEAUX Tristan Charrier, Sophie Pinchinat, François Schwarzentruber
2017	J	`jnl`	Preface. FLAP Sophie Pinchinat, François Schwarzentruber
2016	J	`jnl`	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. Mohamadou Lamine Diouf, Sophie Pinchinat
2016	—	`conf`	On the Soundness of Attack Trees. GraMSec Maxime Audinot, Sophie Pinchinat
2016	—	`conf`	Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. ICTCS Catalin Dima, Bastien Maubert, Sophie Pinchinat
2015	—	`conf`	ATSyRa: An Integrated Environment for Synthesizing Attack Trees - (Tool Paper). GraMSec Sophie Pinchinat, Mathieu Acher, Didier Vojtisek
2015	J	`jnl`	Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems. Discret. Event Dyn. Syst. Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand
2015	J	`jnl`	Expressiveness and succinctness of a logic of robustness. J. Appl. Non Class. Logics John Christopher McCabe-Dansted, Tim French, Sophie Pinchinat, Mark Reynolds
2015	B	`conf`	Games with Communication: From Belief to Preference Change. PRIMA Guillaume Aucher, Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
2015	—	`conf`	Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. MFCS (1) Catalin Dima, Bastien Maubert, Sophie Pinchinat
2015	J	`jnl`	The complexity of one-agent refinement modal logic. Theor. Comput. Sci. Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
2015	J	`jnl`	Uniform strategies, rational relations and jumping automata. Inf. Comput. Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
2015	B	`conf`	Unifying Hyper and Epistemic Temporal Logics. FoSSaCS Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
2014	J	`jnl`	A General Notion of Uniform Strategies. IGTR Bastien Maubert, Sophie Pinchinat
2014	—	`conf`	Automata Techniques for Epistemic Protocol Synthesis. SR Guillaume Aucher, Bastien Maubert, Sophie Pinchinat
2014	J	`jnl`	Refinement modal logic. Inf. Comput. Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
2014	J	`jnl`	The Expressive Power of Epistemic $μ$-Calculus. CoRR Catalin Dima, Bastien Maubert, Sophie Pinchinat
2014	—	`conf`	Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis. SEFM Workshops Sophie Pinchinat, Mathieu Acher, Didier Vojtisek
2014	J	`jnl`	Unifying Hyper and Epistemic Temporal Logic. CoRR Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
2014	J	`jnl`	Verification of gap-order constraint abstractions of counter systems. Theor. Comput. Sci. Laura Bozzelli, Sophie Pinchinat
2013	—	`conf`	Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre
2013	—	`conf`	Jumping Automata for Uniform Strategies. FSTTCS Bastien Maubert, Sophie Pinchinat
2013	J	`jnl`	Specifying Robustness. CoRR John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat
2013	A*	`conf`	The Complexity of One-Agent Refinement Modal Logic. IJCAI Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
2013	—	`conf`	The Complexity of Synthesizing Uniform Strategies SR Bastien Maubert, Sophie Pinchinat, Laura Bozzelli
2013	J	`jnl`	VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181). Dagstuhl Reports Alessio Lomuscio, Sophie Pinchinat, Holger Schlingloff
2012	—	`conf`	Analysis of partially observed recursive tile systems. WODES Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand
2012	J	`jnl`	Modal event-clock specifications for timed component-based design. Sci. Comput. Program. Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
2012	J	`jnl`	On timed alternating simulation for concurrent timed games. Acta Informatica Laura Bozzelli, Axel Legay, Sophie Pinchinat
2012	J	`jnl`	Refinement Modal Logic CoRR Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
2012	B	`conf`	The Complexity of One-Agent Refinement Modal Logic. JELIA Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
2012	J	`jnl`	Uniform Strategies CoRR Bastien Maubert, Sophie Pinchinat
2012	B	`conf`	Verification of Gap-Order Constraint Abstractions of Counter Systems. VMCAI Laura Bozzelli, Sophie Pinchinat
2011	J	`jnl`	Hardness of preorder checking for basic formalisms. Theor. Comput. Sci. Laura Bozzelli, Axel Legay, Sophie Pinchinat
2011	—	`conf`	Opacity Issues in Games with Imperfect Information GandALF Bastien Maubert, Sophie Pinchinat, Laura Bozzelli
2010	B	`conf`	Future Event Logic - Axioms and Complexity. Advances in Modal Logic Hans van Ditmarsch, Tim French, Sophie Pinchinat
2010	—	`conf`	Hardness of Preorder Checking for Basic Formalisms. LPAR (Dakar) Laura Bozzelli, Axel Legay, Sophie Pinchinat
2009	C	`conf`	A Compositional Approach on Modal Specifications for Timed Systems. ICFEM Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
2009	—	`conf`	Diagnosability of Pushdown Systems. Haifa Verification Conference Christophe Morvan, Sophie Pinchinat
2009	—	`conf`	Game Quantification Patterns. ICLA Dietmar Berwanger, Sophie Pinchinat
2009	—	`conf`	Games with Opacity Condition. RP Bastien Maubert, Sophie Pinchinat
2009	—	`conf`	On Timed Alternating Simulation for Concurrent Timed Games. FSTTCS Laura Bozzelli, Axel Legay, Sophie Pinchinat
2009	C	`conf`	On the Expressivity of RoCTL*. TIME John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat
2009	J	`jnl`	Prognosis of Discret. Event Dyn. Syst. Andreas Bauer, Sophie Pinchinat
2009	C	`conf`	Refinement and Consistency of Timed Modal Specifications. LATA Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet
2007	B	`conf`	A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. ATVA Sophie Pinchinat
2007	J	`jnl`	Modal Specifications for the Control Theory of Discrete Event Systems. Discret. Event Dyn. Syst. Guillaume Feuillade, Sophie Pinchinat
2005	J	`jnl`	A decidable class of problems for control under partial observation. Inf. Process. Lett. Sophie Pinchinat, Stéphane Riedweg
2005	—	`conf`	On the Architectures in Decentralized Supervisory Control. CDC/ECC Sophie Pinchinat, Stéphane Riedweg
2005	C	`conf`	You can always compute maximally permissive controllers under partial observation when they exist. ACC Sophie Pinchinat, Stéphane Riedweg
2003	B	`conf`	Quantified Mu-Calculus for Control Synthesis. MFCS Stéphane Riedweg, Sophie Pinchinat
2002	—	`conf`	A Decidable Clock Language for Synchronous Specifications. SLAP Mirabelle Nebut, Sophie Pinchinat
2000	C	`conf`	Supervisory control problem using symbolic bisimulation techniques. ACC Hervé Marchand, Sophie Pinchinat
1998	—	`conf`	Intensional Approaches for Symbolic Methods. MFCS Workshop on Concurrency Olga Kushnarenko, Sophie Pinchinat
1998	—	`conf`	Taxonomy and Expressiveness of Preemption: A Syntactic Approach. ASIAN Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar
1995	—	`conf`	Preemption Primitives in Reactive Languages (A Preliminary Report). ASIAN Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar
1995	J	`jnl`	Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
1993	—	`—`	Des bisimulations pour la sémantique des systèmes réactifs. (Bisimulations for the semantics of reactive systems). Sophie Pinchinat
1993	—	`conf`	Translation Results for Modal Logics of Reactive Systems. AMAST François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
1991	B	`conf`	Ordinal Processes in Comparative Concurrency Semantics. CSL Sophie Pinchinat
1990	A	`conf`	On the Weak Adequacy of Branching-Time Remporal Logic. ESOP Philippe Schnoebelen, Sophie Pinchinat