PUBLICATIONS

* Books, book chapters * Journals, Electronic Journals * International Conferences
and Workshops
* Technical and Research
Reports, Misc
* Thesis

DBLP: Sophie Pinchinat

2017

* Special Issue: Tools for Teaching Logic. Volume 4, Number 1, The IfColog Journal of Logics and their Applications (FLAP). January 2017

2016

* On the Soundness of Attack Trees (preprint)
Maxime Audinot and Sophie Pinchinat
GraMSec 2016, 3rd International Workshop on Graphical Models for Security, Lisbon, Portugal, June 27, 2016. Co-located with CSF 2016.
 
* Relating paths in transition systems: the fall of the modal mu-calculus (preprint)
Catalin Dima, Bastien Maubert and Sophie Pinchinat
ICTCS 2016, 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016.
 

2015

* The Complexity of One-Agent Refinement Modal Logic (preprint)
Laura Bozzelli, Hans van Ditmarsch and Sophie Pinchinat
Theor. Comput. Sci. 603: 58-83 (2015), WoLLIC 2012 Special Issue.
 
* Expressiveness and Succinctness of a Logic of Robustness (preprint)
John C. McCabe-Dansted, Tim French, Sophie Pinchinat and Mark Reynolds
Journal of Applied Non-Classical Logics 25(3): 193-228 (2015).
 
* Relating paths in transition systems: the fall of the modal mu-calculus (preprint)
Catalin Dima, Bastien Maubert and Sophie Pinchinat
MFCS 2015, 40th International Symposium on Mathematical Foundations of Computer Science August 24-28, 2015 Milano (Italy).
 
* Games with Communication: From Belief to Preference Change (preprint)
Guillaume Aucher, Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
PRIMA 2015, Principles and Practice of Multi-Agent Systems - Bertinoro, FC, Italy 26-30 October 2015.
 
* ATSyRa: An Integrated Environment for Synthesizing Attack Trees (preprint)
Sophie Pinchinat, Mathieu Acher and Didier Vojtisek
GraMSec 2015, 2nd International Workshop on Graphical Models for Security Verona, Italy - July 13, 2015. Co-located with CSF 2015.
 
* Unifying Hyper and Epistemic Temporal Logics (preprint)
Laura Bozzelli, Bastien Maubert and Sophie Pinchinat
FoSSaCS 2015: 167-182, 18th Int. Conf. on Foundations of Software Science and Computation Structures, 11-18 April 2015, London, UK
 
* Diagnosis and Opacity Problems for Infinite State Systems Modeled by Recursive Tile Systems (preprint)
Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand
Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems.
Discrete Event Dynamic Systems 25(1-2): 271-294 (2015)
 
* Uniform Strategies, Rational Relations and Jumping Automata (preprint)
Laura Bozzelli, Bastien Maubert and Sophie Pinchinat
Information and Computation 242: 80-107 (2015)
 

2014

* Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis
Sophie Pinchinat, Mathieu Acher, Didier Vojtisek
SEFM-FMDS 2014, Software Engineering and Formal Methods - SEFM 2014 Collocated Workshops. LNCS 8938.
 
* Automata Techniques for Epistemic Protocol Synthesis
Guillaume Aucher, Bastien Maubert and Sophie Pinchinat
SR 2014, 2nd International Workshop on Strategic Reasoning.
 
* Refinement Modal Logic (preprint)
Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
Information and Computation 239: 303-339 (2014).
 
* Verification of gap-order constraint abstractions of counter systems (preprint)
Laura Bozzelli and Sophie Pinchinat
Theoretical Computer Science, 523: 1-36 (2014)
 
* A General Notion of Uniform Strategies (preprint)
Bastien Maubert and Sophie Pinchinat
International Game Theory Review, 16(1).
 

2013

* Jumping automata for uniform strategies
Bastien Maubert and Sophie Pinchinat
FSTTCS 2013, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science,
 
* Emptiness of alternating tree automata using games with imperfect information
Nathanaël Fijalkow, Sophie Pinchinat and Olivier Serre
FSTTCS 2013, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science,
 
* VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181)
Alessio Lomuscio, Sophie Pinchinat and Hölger Schlingloff
Dagstuhl Reports 3(4): 151-187 (2013)
 
* The complexity of one-agent Refinement Modal Logic
Laura Bozzelli, Hans van Ditmarsch and Sophie Pinchinat
IJCAI 2013, 23rd. International Joint Conference on Artificial Intelligence August 3-9, 2013 Beijing, China.
Best Papers in Sister Conferences.
 
* The Complexity of Synthesizing Uniform Strategies
Bastien Maubert, Sophie Pinchinat and Laura Bozzelli
SR 2013, 1rst International Workshop on Strategic Reasoning.
EPTCS vol. 112, pages 115--122.
 
* Specifying Robustness
John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat
CoRR abs/1309.4416 (2013)
 

2012

* Modal event-clock specifications for timed component-based design.
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
Sci. Comput. Program. 77(12): 1212-1234 (2012)
 
* The complexity of one-agent Refinement Modal Logic
Laura Bozzelli, Hans van Ditmarsch and Sophie Pinchinat
JELIA 2012, 13th European Conference on Logics in Artificial Intelligence, Toulouse, France, September 26-28, 2012.
Best Papers Award.
 
* Analysis of partially observed recursive tile systems
Sébastien Chédor, Christophe Morvan, Sophie Pinchinat and Hervé Marchand
WODES 2012, 11th Workshop on Discrete Event Systems, Guadalajara Mexico, October 3-5, 2012.
 
* Uniform strategies
Bastien Maubert and Sophie Pinchinat.
LOFT 2012, 10th Conference on Logic and the Foundations of Game and Decision Theory University of Sevilla, Spain, June 18-20, 2012
 
* Emptiness of alternating parity tree automata using games with imperfect information
Sophie Pinchinat and Olivier Serre
IRISA Techincal Report 1992, 2012.
 
* On Timed Alternating Simulation for Concurrent Timed Games
Laura Bozzelli, Sophie Pinchinat and Axel Legay
Acta Informatica 49(4): 249-279.
 
* Verification of gap-order constraint abstractions of counter systems
Laura Bozzelli and Sophie Pinchinat
VMCAI 2012, 13th International Conference on Verification, Model Checking, and Abstract Interpretation, Philadelphia, USA, January 25-27, 2012.

2011

* Hardness of preorder checking for basic formalisms
Laura Bozzelli, Sophie Pinchinat and Axel Legay.
Theoretical Computer Science 412(49): 6795-6808 (2011) Bibtex
 
* Opacity Issues in Games with Imperfect Information
Bastien Maubert, Sophie Pinchinat and Laura Bozzelli.
Gandalf 2011, 2nd International Symposium on Games, Automata, Logics and Formal Verification, Minori, Italy, 15-17 June 2011. Bibtex
 
* Modal event-clock specifications for timed component-based design
Nathalie Bertrand, Axel Legay, Sophie Pinchinat and Jean-Baptiste. Raclet.
Science of Computer Programming 00 (2011) 1-29. Bibtex
 

2010

* Computing the winning coalitions of a turn-based game with reachability objectives
Lois Vanhée and Sophie Pinchinat.
GASICS 2010 2nd Workshop on Games for Design, Verification and Synthesis, Colocated with CONCUR'10, Paris, France, 4 September 2010. Bibtex
 
* Future event logic: axioms and complexity
Hans van Ditmarsch, Tim French and Sophie Pinchinat
AiML2010, 8th International Conference on Advances in Modal Logic, Moscow, Russia, August 24-27, 2010. Bibtex
 
* Hardness of preorder checking for basic formalisms
Laura Bozzelli, Sophie Pinchinat and Axel Legay.
LPAR-16, 16th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Dakar, Senegal, April 25-May 1, 2010. Bibtex
 

2009

* On Timed Alternating Simulation for Concurrent Timed Games
Laura Bozzelli, Axel Legay and Sophie Pinchinat.
FSTTCS2009, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science December 15 to 17, 2009, IIT Kanpur, India. Bibtex
 
* A Compositional Approach on Modal Specifications for Timed Systems.
Nathalie Bertrand, Axel Legay, Sophie Pinchinat and Jean-Baptiste Raclet
ICFEM2009, 11th International Conference on Formal Engineering Methods, December 9-12, 2009, Rio de Janeiro, Brazil. Full version available in RR INRIA n°7039. Bibtex
 
* Games with Opacity Condition
Bastien Maubert and Sophie Pinchinat.
RP2009, 3rd Workshop on Reachability Problems, LIX Colloquium Reachability Problems'09, Ecole Polytechnique, France, September 23rd-25th 2009. Bibtex
 
* Diagnosability of Pushdown Systems
Christophe Morvan and Sophie Pinchinat.
HVC2009, Haifa Verification Conference, October 19-22, 2009. Organized by IBM R&D Labs in Israel. LNCS 6405, pp. 21-33. (also presented in the workshop Automata: from Mathematics to Applications, Liège, Belgium, June 8-12, 2009). Bibtex
 
* Prognosis of $\omega$-languages for the Diagnosis of $*$-languages: A Topological Perspective. Andreas Bauer and Sophie Pinchinat.
Discrete Event Dynamic Systems, 19(4):451-470 (2009). DOI: 10.1007/s10626-009-0084-5. Bibtex
 
* On the Expressivity of RoCTL*
John McCabe-Dansted, Tim French, Sophie Pinchinat and Mark Reynolds.
TIME2009, 16th International Symposium on Temporal Representation and Reasoning, Brixen-Bressanone, Italy 23-25 July 2009. Bibtex
 
* Refinement and Consistency of Timed Modal Specifications
Nathalie Bertrand, Sophie Pinchinat and Jean-Baptiste Raclet
LATA2009, 3rd International Conference on Language and Automata Theory and Applications (Tarragona, Spain, April 2-8, 2009), LNCS. Springer 2009. Bibtex
 
* Game Quantification Patterns
D. Berwanger and S. Pinchinat.
ICLA2009, 3rd Indian Conference on Logic and its Applications, Chennai, India, January 7-11, 2009, LNAI 5378, pp. 116-130. Springer 2009. Bibtex
 

2008

* A Topological Perspective on Diagnosis
A. Bauer and S. Pinchinat. 9th International Workshop on Discrete Event Systems (Göteborg, Sweden, May 28-30, 2008). Bibtex
 
* Diagnosis of Pushdown Systems (Full version)
Christophe Morvan and Sophie Pinchinat.
IRISA research report number 1904, 2008. Bibtex
 

2007

* A generic constructive solution for concurrent games with expressive constraints on strategies
S. Pinchinat. 5th International Symposium on Automated Technology for Verification and Analysis (Tokyo, Japan, October 22-25, 2007), LNCS 4762, pages 253-267. Bibtex
 
* Modal Specifications for the Control Theory of Discrete-Event Systems. G. Feuillade and S. Pinchinat.
Discrete Event Dynamic Systems, 17(2):211-232 (2007).
DOI 10.1007/s10626-006-0008-6 NOTES Bibtex
 
* Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures
S. Pinchinat
Technical Report ANU February 2007. Bibtex
 

2006

* A Constructive and Modular Approach to Decentralized Supervisory Control Problems
J. Komenda and H. Marchand and S. Pinchinat. 3rd International IFAC Workshop on Discrete-Event System Design (Rydzyna Castle, Poland, 26-28 September 2006). Bibtex
 
* Supervision Patterns in Discrete Event Systems Diagnosis
T. Jéron and H. Marchand and S. Pinchinat and M-O. Cordier. 8th International Workshop on Discrete Event Systems (Ann Arbor, Michigan, USA, 10-12 July 2006). Bibtex
 
* A Constructive and Modular Approach to Decentralized Supervisory Control Problems
J. Komenda and H. Marchand and S. Pinchinat.
{3rd IFAC Workshop on Discrete-Event System Design, DESDes'06, Rydzyna Castle, Poland, September 2006.

2005

* On the Architectures in Decentralized Supervisory Control.
S. Pinchinat and S. Riedweg. 44th IEEE Conference on Decision and Control and European Control Conference (Seville, Spain, 12-15 December 2005) Bibtex
 
* You Can Always Compute Maximally Permissive Controllers Under Partial Observation When They Exist.
S. Riedweg and S. Pinchinat. 24th American Control Conference (Portland, Oregon, 8-10 June 2005). Bibtex
 
* Supervisory Control Problems for Nondeterministic Discrete-Event Systems: a Logical Approach.
J-B. Raclet and S. Pinchinat. 16th IFAC World Congress (Prague, Czech Republic, 4-8 July, 2005). Bibtex
 
* Spécifications modales de réseaux de Petri. (in French) G. Feuillade and S. Pinchinat
Journal Européen des Systèmes Automatisés 39(1):287-301 (2005). Bibtex
 
* A Decidable Class of Problems for Control under Partial Observation. S. Pinchinat and S. Riedweg.
Information Processing Letters 95(4):454-460 (2005). Bibtex
 
* The Control of Non-deterministic Systems: a logical approach. J-B. Raclet and S. Pinchinat.
16th IFAC Word Congress, Prague, Czech Republic, July 4-8, 2005. Bibtex
 

2004

* Maximally Permissive Controllers in All Contexts.
S. Riedweg and S. Pinchinat. 7th International Workshop on Discrete Event Systems (Reims, France, 22-24 septembre, 2004). Also in Electronic Journal "Sciences des Technologies et de l'Automatique". Bibtex
 
* The Control of Non-deterministic Systems : a logical approach. Internal Report 2004
S. Pinchinat and J.B. Raclet.
Internal Report 1648, November 2004. Bibtex
 

2003

* Quantified Mu-Calculus for Control Synthesis.
S. Riedweg and S. Pinchinat. 28th International Symposium on Mathematical Foundations of Computer Science (Bratislava, Slovak Republic, August 2003) Bibtex
also available as Inria Research Report RR 4793
 
* Quantified Loop-mu-calculus for Control under Partial Observation.
S. Riedweg and S. Pinchinat.
INRIA Technical Report 4949, September 2003. Bibtex
 

2002

* A decidable clock language for synchronous specifications. M. Nebut and S. Pinchinat.
Electronic Notes in Theoretical Computer Science, vol. 65(5):924-938, 2002. Bibtex
 
* PostscriptA decidable clock language for synchronous specifications. with M. Nebut
Workshop on Synchronous Languages, Applications, and Programming (Grenoble, France, April 2002) Bibtex
 

2001

* A Framework to Analyse Synchronous Data-Flow Specifications. Technical Report 2002
with M. Nebut.
IRISA Technical Report 1402, November 2001. Bibtex
 

2000

* Symbolic Abstractions of Automata.   with H. Marchand
5th Workshop on Discrete Event Systems (Ghent, Belgium, August 2000). Bibtex
 
* Supervisory Control Problem using Symbolic Techniques. with H. Marchand
2000 American Control Conference (Chicago, Illinois, USA, June 2000) Bibtex
 

Before 2000

* Symbolic Abstractions of Automata and their application to the Supervisory Control Problem.
with H. Marchand and M. LeBorgne.
IRISA Research Report 1279, November 1999 Bibtex
 
* Intentional approaches for symbolic methods. O. Kouchnarenko and S. Pinchinat.
23rd International Symposium on Mathematical Foundations of Computer Science (Brno, Czech Republic, August 1998). Bibtex
 
* Taxonomy and expressiveness of preemption : a syntactic approach. with E. Rutten and R.K. Shyamasundar
Asian Computing Science Conference (Manila, The Philippines, December 1998) Bibtex
 
* Intensional approaches for symbolic methods. O. Kouchnarenko and S. Pinchinat.
Electronic Notes in Theoretical Computer Science, vol. 18, 1998. Bibtex
 
* Labeling Automata with Polynomials. with O. Kouchnarenko
ESSLLI 1998 (International Workshop on Reasoning about Actions joint to ESSLLI98, Saarbrueken, Germany, Août 1998) Bibtex
 
* SOS specifications and Compositional ST-semantics. with J.V. Echague
CLI1997 (XXIII Conferencia Latinoamericana de Informaticae, Valparaiso, Chili, Novembre 1997) Bibtex
 
* Preemption primitives in reactive languages (a preliminary report). with E. Rutten and R.K. Shyamasundar
Asian Computing Science Conference (Pathumthani, Thailand, LNCS, Springer-Verlag, December 1995) Bibtex
 
* Structural Operational Semantics for True Concurrency with J.V. Echagüe, Z. Habbas, S. Pinchinat.
15th International Conference of the Chilean Computer Science Society (Arica, Chili, November 1995) Bibtex
 
* Translation Results for Modal Logics of Reactive Systems. F. Laroussinie and S. Pinchinat and Ph. Schnoebelen.
Theoretical Computer Science, 40(1):53-71 (1995). Bibtex
 
* Translation Results for Modal Logics of Reactive Systems. with F. Laroussinie and Ph. Schnoebelen.
3rd International Conference on Methodology and Software Technology (University of Twente, Enschede, The Netherlands, 21-25 June). Maurice Nivat, Charles Rattray, Teodor Rus, Giuseppe Scollo (Eds.): Algebraic Methodology and Software Technology (AMAST '93), Proceedings of the Third, 297-306, 1993. Bibtex
 
* Des Bisimulations pour la Sémantique des Systèmes Réactifs
PhD Thesis of université Joseph Fourier, Grenoble, January 1993. Bibtex
 
* On the Weak Adequacy of Branching-Time Remporal Logic
with Philippe Schnoebelen
ESOP'90, 3rd European Symposium on Programming, Copenhagen, Denmark, May 15-18, 1990. LNCS 423. ISBN 3-540-52592-0. Bibtex