关注
Sophie Pinchinat
Sophie Pinchinat
Univ Rennes/CNRS
在 irisa.fr 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Supervision patterns in discrete event systems diagnosis
T Jéron, H Marchand, S Pinchinat, MO Cordier
2006 8th International Workshop on Discrete Event Systems, 262-268, 2006
1762006
Beyond 2014: Formal Methods for Attack Tree--based Security Modeling
W Wideł, M Audinot, B Fila, S Pinchinat
ACM Computing Surveys (CSUR) 52 (4), 1-36, 2019
702019
Quantified mu-calculus for control synthesis
S Riedweg, S Pinchinat
International Symposium on Mathematical Foundations of Computer Science, 642-651, 2003
552003
Is my attack tree correct?
M Audinot, S Pinchinat, B Kordy
Computer Security–ESORICS 2017: 22nd European Symposium on Research in …, 2017
442017
Refinement modal logic
L Bozzelli, H van Ditmarsch, T French, J Hales, S Pinchinat
Information and Computation 239, 303-339, 2014
442014
A generic constructive solution for concurrent games with expressive constraints on strategies
S Pinchinat
International Symposium on Automated Technology for Verification and …, 2007
432007
Unifying hyper and epistemic temporal logics
L Bozzelli, B Maubert, S Pinchinat
International Conference on Foundations of Software Science and Computation …, 2015
422015
Modal specifications for the control theory of discrete event systems
G Feuillade, S Pinchinat
Discrete Event Dynamic Systems 17, 211-232, 2007
412007
ATSyRa: An Integrated Environment for Synthesizing Attack Trees: (Tool Paper)
S Pinchinat, M Acher, D Vojtisek
International workshop on graphical models for security, 97-101, 2015
392015
Refinement and consistency of timed modal specifications
N Bertrand, S Pinchinat, JB Raclet
International Conference on Language and Automata Theory and Applications …, 2009
392009
Towards synthesis of attack trees for supporting computer-aided risk analysis
S Pinchinat, M Acher, D Vojtisek
Software Engineering and Formal Methods: SEFM 2014 Collocated Workshops …, 2015
372015
Verification of gap-order constraint abstractions of counter systems
L Bozzelli, S Pinchinat
Theoretical Computer Science 523, 1-36, 2014
372014
DEL-based epistemic planning: Decidability and complexity
T Bolander, T Charrier, S Pinchinat, F Schwarzentruber
Artificial Intelligence 287, 103304, 2020
342020
A compositional approach on modal specifications for timed systems
N Bertrand, A Legay, S Pinchinat, JB Raclet
International Conference on Formal Engineering Methods, 679-697, 2009
322009
Future Event Logic-Axioms and Complexity.
H van Ditmarsch, T French, S Pinchinat
Advances in Modal Logic 8 (8), 77-99, 2010
302010
Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
S Chédor, C Morvan, S Pinchinat, H Marchand
Discrete Event Dynamic Systems 25, 271-294, 2015
292015
The complexity of one-agent refinement modal logic
L Bozzelli, H Van Ditmarsch, S Pinchinat
Theoretical Computer Science 603, 58-83, 2015
282015
Guided design of attack trees: a system-based approach
M Audinot, S Pinchinat, B Kordy
2018 IEEE 31st Computer Security Foundations Symposium (CSF), 61-75, 2018
262018
You can always compute maximally permissive controllers under partial observation when they exist
S Pinchinat, S Riedweg
Proceedings of the 2005, American Control Conference, 2005., 2287-2292, 2005
262005
Small Undecidable Problems in Epistemic Planning.
S Lê Cong, S Pinchinat, F Schwarzentruber
IJCAI, 4780-4786, 2018
242018
系统目前无法执行此操作,请稍后再试。
文章 1–20