default search action
Sophie Pinchinat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c54]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. LATIN (2) 2024: 257-271 - [c53]Sophie Pinchinat:
Strategic Reasoning Under Imperfect Information with Synchronous Semantics (Invited Talk). TIME 2024: 2:1-2:2 - 2023
- [c52]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque. CNIA 2023 - [i13]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages. CoRR abs/2312.00458 (2023) - 2022
- [c51]Sophie Pinchinat, Sasha Rubin, François Schwarzentruber:
Formula Synthesis in Propositional Dynamic Logic with Shuffle. AAAI 2022: 9902-9909 - [c50]Dylan Bellier, Sophie Pinchinat, François Schwarzentruber:
Dependency Matrices for Multiplayer Strategic Dependencies. FSTTCS 2022: 31:1-31:21 - [c49]Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko:
Adversarial Formal Semantics of Attack Trees and Related Problems. GandALF 2022: 162-177 - [e2]David Fernández-Duque, Alessandra Palmigiano, Sophie Pinchinat:
Advances in Modal Logic, AiML 2022, Rennes, France, August 22-25, 2022. College Publications 2022, ISBN 978-1-84890-413-2 [contents] - [i12]Côme Neyrand, Sophie Pinchinat:
On the Role of Postconditions in Dynamic First-Order Epistemic Logic. CoRR abs/2205.00876 (2022) - 2021
- [j23]Johann Gamper, Sophie Pinchinat, Guido Sciavicco:
Special Issue - Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning. Inf. Comput. 280: 104635 (2021) - [j22]Raphaël Berthon
, Nathanaël Fijalkow
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22(1): 7:1-7:24 (2021) - 2020
- [j21]Thomas Bolander
DEL-based epistemic planning: Decidability and complexity. Artif. Intell. 287: 103304 (2020) - [c48]Bastien Maubert, Aniello Murano
Dynamic Epistemic Logic Games with Epistemic Temporal Goals. ECAI 2020: 155-162 - [c47]Sophie Pinchinat, François Schwarzentruber, Sébastien Lê Cong:
Library-Based Attack Tree Synthesis. GraMSec@CSF 2020: 24-44 - [c46]Bastien Maubert, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri:
Concurrent Games in Dynamic Epistemic Logic. IJCAI 2020: 1877-1883 - [i11]Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri:
Dynamic Epistemic Logic Games with Epistemic Temporal Goals. CoRR abs/2001.07141 (2020) - [i10]Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre:
Alternating Tree Automata with Qualitative Semantics. CoRR abs/2002.03664 (2020)
2010 – 2019
- 2019
- [j20]Wojciech Widel
Beyond 2014: Formal Methods for Attack Tree-based Security Modeling. ACM Comput. Surv. 52(4): 75:1-75:36 (2019) - [j19]Tristan Charrier, Sophie Pinchinat, François Schwarzentruber:
Symbolic model checking of public announcement protocols. J. Log. Comput. 29(8): 1211-1249 (2019) - [j18]Sophie Pinchinat:
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 107(5): 1083-1088 (2019) - [c45]Sophie Pinchinat, Barbara Fila, Florence Wacheux, Yann Thierry-Mieg:
Attack Trees: A Notion of Missing Attacks. GraMSec@CSF 2019: 23-49 - [c44]Bastien Maubert, Sophie Pinchinat, François Schwarzentruber:
Reachability Games in Dynamic Epistemic Logic. IJCAI 2019: 499-505 - [e1]Johann Gamper
26th International Symposium on Temporal Representation and Reasoning, TIME 2019, October 16-19, 2019, Málaga, Spain. LIPIcs 147, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-127-6 [contents] - [i9]Bastien Maubert, Sophie Pinchinat, François Schwarzentruber:
Reachability Games in Dynamic Epistemic Logic. CoRR abs/1905.12422 (2019) - [i8]Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber:
The Packed Interval Covering Problem is NP-complete. CoRR abs/1906.03676 (2019) - 2018
- [j17]Catalin Dima
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Trans. Comput. Log. 19(3): 23:1-23:33 (2018) - [c43]Gaëtan Douéneau-Tabot, Sophie Pinchinat, François Schwarzentruber:
Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis. Advances in Modal Logic 2018: 237-256 - [c42]Maxime Audinot, Sophie Pinchinat, Barbara Kordy:
Guided Design of Attack Trees: A System-Based Approach. CSF 2018: 61-75 - [c41]Maxime Audinot, Sophie Pinchinat, François Schwarzentruber, Florence Wacheux:
Deciding the Non-emptiness of Attack Trees. GraMSec@FLoC 2018: 13-30 - [c40]Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber:
Small Undecidable Problems in Epistemic Planning. IJCAI 2018: 4780-4786 - 2017
- [j16]Sophie Pinchinat, François Schwarzentruber:
Preface. FLAP 4(1) (2017) - [c39]Maxime Audinot, Sophie Pinchinat, Barbara Kordy:
Is My Attack Tree Correct? ESORICS (1) 2017: 83-102 - [c38]Tristan Charrier, Sophie Pinchinat, François Schwarzentruber:
Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment. DALI@TABLEAUX 2017: 133-152 - [i7]Maxime Audinot, Sophie Pinchinat, Barbara Kordy:
Is my attack tree correct? Extended version. CoRR abs/1706.08507 (2017) - 2016
- [j15]Mohamadou Lamine Diouf, Sophie Pinchinat:
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. 25 (2016) - [c37]Maxime Audinot, Sophie Pinchinat:
On the Soundness of Attack Trees. GraMSec@CSF 2016: 25-38 - [c36]Catalin Dima, Bastien Maubert, Sophie Pinchinat:
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. ICTCS 2016: 240-244 - 2015
- [j14]Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand:
Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems. Discret. Event Dyn. Syst. 25(1-2): 271-294 (2015) - [j13]Laura Bozzelli, Bastien Maubert
Uniform strategies, rational relations and jumping automata. Inf. Comput. 242: 80-107 (2015) - [j12]John Christopher McCabe-Dansted, Tim French
Expressiveness and succinctness of a logic of robustness. J. Appl. Non Class. Logics 25(3): 193-228 (2015) - [j11]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The complexity of one-agent refinement modal logic. Theor. Comput. Sci. 603: 58-83 (2015) - [c35]Sophie Pinchinat, Mathieu Acher, Didier Vojtisek:
ATSyRa: An Integrated Environment for Synthesizing Attack Trees - (Tool Paper). GraMSec@CSF 2015: 97-101 - [c34]Laura Bozzelli, Bastien Maubert
Unifying Hyper and Epistemic Temporal Logics. FoSSaCS 2015: 167-182 - [c33]Catalin Dima
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. MFCS (1) 2015: 179-191 - [c32]Guillaume Aucher, Bastien Maubert
Games with Communication: From Belief to Preference Change. PRIMA 2015: 670-677 - 2014
- [j10]Laura Bozzelli, Hans van Ditmarsch, Tim French
Refinement modal logic. Inf. Comput. 239: 303-339 (2014) - [j9]Bastien Maubert
A General Notion of Uniform Strategies. IGTR 16(1) (2014) - [j8]Laura Bozzelli, Sophie Pinchinat:
Verification of gap-order constraint abstractions of counter systems. Theor. Comput. Sci. 523: 1-36 (2014) - [c31]Sophie Pinchinat, Mathieu Acher, Didier Vojtisek:
Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis. SEFM Workshops 2014: 363-375 - [c30]Guillaume Aucher
Automata Techniques for Epistemic Protocol Synthesis. SR 2014: 97-103 - [i6]Catalin Dima, Bastien Maubert, Sophie Pinchinat:
The Expressive Power of Epistemic $μ$-Calculus. CoRR abs/1407.5166 (2014) - [i5]Laura Bozzelli, Bastien Maubert, Sophie Pinchinat:
Unifying Hyper and Epistemic Temporal Logic. CoRR abs/1409.2711 (2014) - 2013
- [c29]Bastien Maubert
Jumping Automata for Uniform Strategies. FSTTCS 2013: 287-298 - [c28]Nathanaël Fijalkow
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS 2013: 299-311 - [c27]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The Complexity of One-Agent Refinement Modal Logic. IJCAI 2013: 2977-2981 - [c26]Bastien Maubert, Sophie Pinchinat, Laura Bozzelli:
The Complexity of Synthesizing Uniform Strategies. SR 2013: 115-122 - [i4]John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat:
Specifying Robustness. CoRR abs/1309.4416 (2013) - [i3]Alessio Lomuscio, Sophie Pinchinat, Holger Schlingloff
VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181). Dagstuhl Reports 3(4): 151-187 (2013) - 2012
- [j7]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
On timed alternating simulation for concurrent timed games. Acta Informatica 49(4): 249-279 (2012) - [j6]Nathalie Bertrand
Modal event-clock specifications for timed component-based design. Sci. Comput. Program. 77(12): 1212-1234 (2012) - [c25]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The Complexity of One-Agent Refinement Modal Logic. JELIA 2012: 120-133 - [c24]Laura Bozzelli, Sophie Pinchinat:
Verification of Gap-Order Constraint Abstractions of Counter Systems. VMCAI 2012: 88-103 - [c23]Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand:
Analysis of partially observed recursive tile systems. WODES 2012: 265-271 - [i2]Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat:
Refinement Modal Logic. CoRR abs/1202.3538 (2012) - [i1]Bastien Maubert, Sophie Pinchinat:
Uniform Strategies. CoRR abs/1212.0526 (2012) - 2011
- [j5]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
Hardness of preorder checking for basic formalisms. Theor. Comput. Sci. 412(49): 6795-6808 (2011) - [c22]Bastien Maubert
Opacity Issues in Games with Imperfect Information. GandALF 2011: 87-101 - 2010
- [c21]Hans van Ditmarsch, Tim French, Sophie Pinchinat:
Future Event Logic - Axioms and Complexity. Advances in Modal Logic 2010: 77-99 - [c20]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
Hardness of Preorder Checking for Basic Formalisms. LPAR (Dakar) 2010: 119-135
2000 – 2009
- 2009
- [j4]Andreas Bauer, Sophie Pinchinat:
Prognosis of omega-Languages for the Diagnosis of *-Languages: A Topological Perspective. Discret. Event Dyn. Syst. 19(4): 451-470 (2009) - [c19]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
On Timed Alternating Simulation for Concurrent Timed Games. FSTTCS 2009: 85-96 - [c18]Christophe Morvan, Sophie Pinchinat:
Diagnosability of Pushdown Systems. Haifa Verification Conference 2009: 21-33 - [c17]Nathalie Bertrand
A Compositional Approach on Modal Specifications for Timed Systems. ICFEM 2009: 679-697 - [c16]Dietmar Berwanger
Game Quantification Patterns. ICLA 2009: 116-130 - [c15]Nathalie Bertrand
Refinement and Consistency of Timed Modal Specifications. LATA 2009: 152-163 - [c14]Bastien Maubert
Games with Opacity Condition. RP 2009: 166-175 - [c13]John Christopher McCabe-Dansted, Tim French
On the Expressivity of RoCTL*. TIME 2009: 37-44 - 2007
- [j3]Guillaume Feuillade, Sophie Pinchinat:
Modal Specifications for the Control Theory of Discrete Event Systems. Discret. Event Dyn. Syst. 17(2): 211-232 (2007) - [c12]Sophie Pinchinat:
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. ATVA 2007: 253-267 - 2005
- [j2]Sophie Pinchinat, Stéphane Riedweg:
A decidable class of problems for control under partial observation. Inf. Process. Lett. 95(4): 454-460 (2005) - [c11]Sophie Pinchinat, Stéphane Riedweg:
You can always compute maximally permissive controllers under partial observation when they exist. ACC 2005: 2287-2292 - [c10]Sophie Pinchinat, Stéphane Riedweg:
On the Architectures in Decentralized Supervisory Control. CDC/ECC 2005: 12-17 - 2003
- [c9]Stéphane Riedweg, Sophie Pinchinat:
Quantified Mu-Calculus for Control Synthesis. MFCS 2003: 642-651 - 2002
- [c8]Mirabelle Nebut, Sophie Pinchinat:
A Decidable Clock Language for Synchronous Specifications. SLAP@ETAPS 2002: 125-139 - 2000
- [c7]Hervé Marchand, Sophie Pinchinat:
Supervisory control problem using symbolic bisimulation techniques. ACC 2000: 4067-4071
1990 – 1999
- 1998
- [c6]Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar:
Taxonomy and Expressiveness of Preemption: A Syntactic Approach. ASIAN 1998: 125-141 - [c5]Olga Kushnarenko, Sophie Pinchinat:
Intensional Approaches for Symbolic Methods. MFCS Workshop on Concurrency 1998: 112 - 1995
- [j1]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140(1): 53-71 (1995) - [c4]Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar:
Preemption Primitives in Reactive Languages (A Preliminary Report). ASIAN 1995: 111-125 - 1993
- [b1]Sophie Pinchinat:
Des bisimulations pour la sémantique des systèmes réactifs. (Bisimulations for the semantics of reactive systems). Grenoble Institute of Technology, France, 1993 - [c3]François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen:
Translation Results for Modal Logics of Reactive Systems. AMAST 1993: 297-306 - 1991
- [c2]Sophie Pinchinat:
Ordinal Processes in Comparative Concurrency Semantics. CSL 1991: 293-305 - 1990
- [c1]Philippe Schnoebelen, Sophie Pinchinat:
On the Weak Adequacy of Branching-Time Remporal Logic. ESOP 1990: 377-388
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: