Sophie Pinchinat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Sophie Pinchinat has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Bastien Maubert
Università degli Studi di Napoli Federico II, Italy
7 shared publications - Laura Bozzelli
Technical University of Madrid (UPM)
7 shared publications - Axel Legay
INRIA/IRISA, Rennes, France
3 shared publications Florence Wacheux
Univ Rennes, CNRS, IRISA
2 shared publicationsFrançois Schwarzentruber
Univ Rennes/IRISA/CNRS
2 shared publications- François Schwarzentruber
ENS Rennes
2 shared publications
Latest Publications
- 3 September 2026
- Published by Springer Nature
- p. 589-602
Nuclear Power Plant Modeling and Threat Analysis from a Cyber Security Perspective
- 3 September 2026
- Published by Springer Nature
- p. 589-602
Nuclear Power Plant Modeling and Threat Analysis from a Cyber Security Perspective
- 26 April 2025
- Published by Springer Nature
- p. 38-49
Propositional Dynamic Logic Formula Synthesis and Some Applications
- 26 April 2025
- Published by Springer Nature
- p. 38-49
Propositional Dynamic Logic Formula Synthesis and Some Applications
- Open Access
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games with imperfect information where the actions available to the players are described very precisely. This framework makes it possible to define easily, for instance, classes of games where players can only use public actions or public announcements. These games have been studied for reachability objectives, where the aim is to reach a situation satisfying some epistemic property expressed in epistemic logic; several (un)decidability results have been established. In this work we show that the decidability results obtained for reachability objectives extend to a much more general class of winning conditions, namely those expressible in the epistemic temporal logic LTLK. To do so we establish that the infinite game structures generated by DEL public actions are regular, and we describe how to obtain finite representations on which we rely to solve them.
Open AccessDynamic Epistemic Logic Games with Epistemic Temporal Goals
Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define classes of games with imperfect information where the actions available to the players are described very precisely. This framework makes it possible to define easily, for instance, classes of games where players can only use public actions or public announcements. These games have been studied for reachability objectives, where the aim is to reach a situation satisfying some epistemic property expressed in epistemic logic; several (un)decidability results have been established. In this work we show that the decidability results obtained for reachability objectives extend to a much more general class of winning conditions, namely those expressible in the epistemic temporal logic LTLK. To do so we establish that the infinite game structures generated by DEL public actions are regular, and we describe how to obtain finite representations on which we rely to solve them.
- 28 November 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 23-49
Attack Trees: A Notion of Missing Attacks
- 28 November 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 23-49
Attack Trees: A Notion of Missing Attacks
- 10 September 2019
- Published by Springer Nature in Studia Logica
- Vol. 107 (5) , 1083-1088
S. Demri, V. Goranko, M. Lange, Temporal Logics in Computer Science — Finite-State Systems
- 10 September 2019
- Published by Springer Nature in Studia Logica
- Vol. 107 (5) , 1083-1088
S. Demri, V. Goranko, M. Lange, Temporal Logics in Computer Science — Finite-State Systems
- Open Access
- 4 May 2016
- Published by HAL
Complexity of opacity algorithm in data-centric workflows systems
A property (of an object) is opaque to an observer when he or she cannot deduce the property from its set of observations. If each observer is attached to a given set of properties (the so-called secrets), then the system is said to be opaque if each secret is opaque to the corresponding observer. We study in this paper, the complexity of opacity algorithm in data-centric workflows systems. We show that the complexity of this algorithm is EXPTIME-complete. Using the reduction problem, whe show that we can reduce the complexity of opacity problem to wellknow problem, the intersection of nonemptyness problem of Tree automata in polynomial time.
- 4 May 2016
- Published by HAL
Open AccessComplexity of opacity algorithm in data-centric workflows systems
A property (of an object) is opaque to an observer when he or she cannot deduce the property from its set of observations. If each observer is attached to a given set of properties (the so-called secrets), then the system is said to be opaque if each secret is opaque to the corresponding observer. We study in this paper, the complexity of opacity algorithm in data-centric workflows systems. We show that the complexity of this algorithm is EXPTIME-complete. Using the reduction problem, whe show that we can reduce the complexity of opacity problem to wellknow problem, the intersection of nonemptyness problem of Tree automata in polynomial time.
- Open Access
Complexity of opacity algorithm in data-centric workflows systems
A property (of an object) is opaque to an observer when he or she cannot deduce the property from its set of observations. If each observer is attached to a given set of properties (the so-called secrets), then the system is said to be opaque if each secret is opaque to the corresponding observer. We study in this paper, the complexity of opacity algorithm in data-centric workflows systems. We show that the complexity of this algorithm is EXPTIME-complete. Using the reduction problem, whe show that we can reduce the complexity of opacity problem to wellknow problem, the intersection of nonemptyness problem of Tree automata in polynomial time.
Open AccessComplexity of opacity algorithm in data-centric workflows systems
A property (of an object) is opaque to an observer when he or she cannot deduce the property from its set of observations. If each observer is attached to a given set of properties (the so-called secrets), then the system is said to be opaque if each secret is opaque to the corresponding observer. We study in this paper, the complexity of opacity algorithm in data-centric workflows systems. We show that the complexity of this algorithm is EXPTIME-complete. Using the reduction problem, whe show that we can reduce the complexity of opacity problem to wellknow problem, the intersection of nonemptyness problem of Tree automata in polynomial time.