PUBLICATIONS
To appear in 2010
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, April 25-May 1, 2010, Dakar, Senegal.
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
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.
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.
(also presented in the workshop "Automata: from Mathematics to
Applications", Liège, Belgium, June 8-12, 2009).
Games with Opacity Condition
Bastien Maubert and Sophie Pinchinat
RP2009, LIX Colloquium Reachability Problems'09,
Ecole Polytechnique, France, September 23rd-25th 2009
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
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
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
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
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
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)
Abstract,
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
Maximally Permissive Controllers in All Contexts. S. Riedweg and S. Pinchinat
in Electronic Journal "Sciences des Technologies et de l'Automatique"
(7th Workshop on Discrete Event Systems, pp. 283-288, Reims, France, 22-24 septembre, 2004)
Abstract,
Bibtex
A decidable clock language for synchronous specifications.
M. Nebut and S. Pinchinat.
in Electronic Notes in Theoretical Computer Science, vol. 65(5):924-938, 2002
Abstract,
Bibtex
Intensional approaches for symbolic methods.
O. Kouchnarenko and S. Pinchinat.
in Electronic Notes in Theoretical Computer Science, vol. 18, 1998.
Abstract,
Bibtex
Research Reports
Diagnosis of Pushdown Systems (Full version)
Christophe Morvan and Sophie Pinchinat.
IRISA research report number 1904, 2008.
Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures
S. Pinchinat
Available at http://cs.anu.edu.au/techreports/2007/TR-CS-07-02.html
The Control of Non-deterministic Systems :
a logical approach. Internal Report 2004
S. Pinchinat and J.B. Raclet.
Internal Report 1648, November 2004 (ps ,pdf).
Logical Characterization of Control Problems under Partial Observation.
Technical Report 2003
html , ps, pdf
S. Riedweg and S. Pinchinat.
INRIA Technical Report 4949, September 2003.
Quantified Mu-calculus for Control Synthesis. Technical Report 2003
html , ps, pdf
with S. Riedweg.
INRIA Technical Report 4793, April 2003.
A Framework to Analyse Synchronous Data-Flow Specifications. Technical Report 2002
ps , pdf
with M. Nebut.
IRISA Technical Report 1402, November 2001.
Symbolic Abstractions of Automata and their application to the
Supervisory Control Problem. Postscript
with H. Marchand and M. LeBorgne.
IRISA Research Report 1279, November 1999
Thesis
Contribution à l'Analyse des Systèmes Réactifs
Mémoire d'Habilitation à Diriger les Recherches de l'université de Rennes 1, December 2003
Des Bisimulations pour la Sémantique des Systèmes Réactifs
PhD Thesis of université Joseph Fourier, Grenoble, January 1993
Others
A decidable clock language for synchronous specifications.
with M. Nebut
Workshop on Synchronous Languages, Applications, and Programming (Grenoble, France, April 2002)
Abstract Postscript Bibtex entry
Symbolic Abstractions of Automata.
with H. Marchand
5th Workshop on Discrete Event Systems (Ghent, Belgium, August 2000)
Abstract
Postscript
Bibtex entry
Supervisory Control Problem using Symbolic Techniques.
with H. Marchand
2000 American Control Conference (Chicago, Illinois, USA, June 2000)
Abstract
Postscript
Bibtex entry
Intentional approaches for symbolic methods.
O. Kouchnarenko and S. Pinchinat.
23rd International Symposium on Mathematical Foundations of Computer Science (Brno, Czech Republic, August 1998).
Taxonomy and expressiveness of preemption : a syntactic
approach.
with E. Rutten and R.K. Shyamasundar
Asian Computing Science Conference (Manila, The Philippines, December 1998)
Abstract
Postscript
Bibtex entry
Labeling Automata with Polynomials.
with O. Kouchnarenko
ESSLLI 1998 (International Workshop on Reasoning about Actions joint to ESSLLI98, Saarbrueken, Germany, Août 1998)
Abstract Postscript Bibtex entry
SOS specifications and Compositional ST-semantics.
with J.V. Echague
CLI1997 (XXIII Conferencia Latinoamericana de Informaticae, Valparaiso, Chili, Novembre 1997)
Abstract Postscript Bibtex entry
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)
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)
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 , 1993.
François Laroussinie, Sophie Pinchinat, Ph. Schnoebelen: 297-306.