accueil

 carte
 

Publications of Sophie Pinchinat


haut

 

Journals

  1. O. Kouchnarenko, S. Pinchinat.
    Intensional approachs for symbolic methods.  Electronic Notes in Theoretical Computer Science, 18, 1998. (postscript) (abstract)
  2. F. Laroussinie, S. Pinchinat, P. Schnoebelen.
    Translation Results for Modal Logics of Reactive Systems.  Theoretical Computer Science, 40(1), March 1995.

haut

 

International Conferences

  1. S. Pinchinat, H. Marchand.
    Symbolic Abstractions of Automata.  Proc of 5th Workshop on Discrete Event Systems, WODES 2000, pages 39--48, Ghent, Belgium, August 2000. (postscript) (abstract)
  2. H. Marchand, S. Pinchinat.
    Supervisory Control Problem using Symbolic Bisimulation Techniques.  2000 American Control Conference, pages 4067--4071, Chicago, Illinois, USA, June 2000. (postscript) (abstract)
  3. S. Pinchinat, E. Rutten, R.K. Shyamasundar.
    Taxonomy and expressiveness of preemption : a syntactic approach.  Proceedings of the Asian Computing Science Conference, ASIAN'98, LNCS, Manila, The Philippines, December 1998. (postscript) (abstract)
  4. O. Kouchnarenko, S. Pinchinat.
    Labeling Automata with Polynomials.  Proceedings of the International Workshop on Reasoning about Actions (joint to ESSLLI'98), Saarbrueken, Germany, August 1998. (postscript) (abstract)
  5. O. Kouchnarenko, S. Pinchinat.
    Intensional Approaches for Symbolic Methods.  the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS'98, International Workshop on Concurrency, Brno, Czech Republic, August 1998.
  6. S. Pinchinat, J.V. Echague.
    SOS specifications and Compositional ST-semantics.  XXIII Conferencia Latinoamericana de Informatica, Valparaiso, Chili, November 1997. (postscript) (abstract)
  7. S. Pinchinat, E. Rutten, R.K. Shyamasundar.
    Preemption primitives in reactive languages (a preliminary report).  Proceedings of the Asian Computing Science Conference, ACSC '95, Pathumthani, Thailand, LNCS, Springer-Verlag, December 1995. (postscript) (abstract)
  8. J.V. Echagüe, Z. Habbas, S. Pinchinat.
    Structural Operational Semantics for True Concurrency.  Proc. of the 15th International Conference of the Chilean Computer Science Society, SCCC'95, Arica, Chili, November 1995. (postscript) (abstract)

haut

 

Research reports

  1. S. Pinchinat, H. Marchand, M. LeBorgne.
    Symbolic Abstractions of Automata and their application to the Supervisory Control Problem.  Research report Irisa, No1279, November 1999. (postscript) (abstract)
  2. O. Kouchnarenko, S. Pinchinat.
    Intensional Approaches for Symbolic Methods.  Research report Irisa / Inria-Rennes, No3448, July 1998. (postscript) (abstract)

haut

 

Misc

  1. S. Pinchinat, H. Marchand, M. Le Borgne.
    Deliverable 3.1.3: Symbolic Abstractions of Automata and their application to the Supervisory Control Problem.  Esprit project 22703: Syrf, October 1999.
  2. S. Pinchinat, O Kouchnarenko, H. Marchand, M. Le Borgne.
    Deliverable 3.1.2: Symbolic abstraction of automata: intensional Labeled Transition Systems, symbolic bisimulation.  Esprit project 22703: Syrf, October 1998.
The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors and by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Webmaster : epatr_webmaster@irisa.fr
Ces pages sont créées automatiquement par le
programme bib2html du projet Vista de l'IRISA-INRIA Rennes 		vista