%*****************************************
%*                                       *
%*          Bibliographie                *
%*           C. Morvan                   *
%*                                       *
%*****************************************


@InProceedings{morvan:fossacs00,
author = 	 { C. Morvan},
title = 	 {On rational graphs},
booktitle =    {{\rm {\small F}ossacs~00}},
editor = 	 {J. Tiuryn}, 
series = 	 {{\small LNCS}},
volume = 	 {1784},
pages = 	 {252--266},
note = 	 {ETAPS 2000 best theoretical paper Award},
year = 	 {2000},
}

@TechReport{morvan:rr00,
author = 	 {C. Morvan},
title = 	 {On rational graphs},
institution =  {INRIA},
year = 	 {2000},
type = 	 {Rapport de recherche},
number = 	 3944,
month = 	 {Mai}
}

@InProceedings{morvan:mfcs01,
author = 	 { C. Morvan and C. Stirling},
title = 	 {Rational graphs trace context-sensitive languages},
booktitle =    {{\rm {\small MFCS}~01}},
editor = 	 {A. Pultr and J. Sgall}, 
series = 	 {{\small LNCS}},
volume =	 {2136},
pages =	 {548--559},
year = 	 {2001},
}

@PhdThesis{morvan:these,
author = 	 {C. Morvan},
title = 	 {Les graphes rationnels},
school = 	 {Université de Rennes 1},
year = 	 2001,
type =	 {Thèse de Doctorat},
month = {Novembre},
}

@article{morvan:acta,
AUTHOR = {C. Morvan and C. Rispal},
TITLE = {Families of automata charaterizing context-sensitive languages},
JOURNAL = {Acta Informatica},
YEAR = {2005},
VOLUME = {41},
PAGES = {293--314},
} 


@InProceedings{morvan:csl06,
  author = 	 {A. Carayol and C. Morvan},
  title = 	 {On rational trees},
  booktitle = 	 {\rm{\small CSL}~06},
  pages = 	 {225--239},
  year = 	 {2006},
  editor = 	 {Zolt\'an Ésik},
  volume = 	 {4207},
  series = 	 {{\small LNCS}},
}

@InProceedings{morvan:mons06,
  author = 	 {C. Morvan},
  title = 	 {Classes of rational graphs},
  booktitle = 	 {Journées Montoises d'informatique théorique},
  year = 	 {2006},
}

@TechReport{morvan:rr08,
  author = 	 {C. Morvan and S. Pinchinat},
  title = 	 {Diagnosis of pushdown systems},
  institution =  {IRISA},
  year = 	 {2008},
  type = 	 {Rapport de recherche},
  number = 	 {1904},
  note = 	 {Publié dans HVC 2009},
}

@TechReport{morvan:rr09,
  author = 	 {C. Morvan},
  title = 	 {Contextual graph grammars characterizing context-sensitive languages},
  institution =  {IRISA},
  year = 	 {2009},
  type = 	 {Rapport de recherche},
  number = 	 1926,
  note = 	 {Publié dans Infinity 2010},
  month = 	 {March}
}

 @InProceedings{morvan:automatha09,
  author = 	 {C. Morvan and S. Pinchinat},
  title = 	 {Diagnosability of pushdown systems},
  booktitle = 	 {AutomathA},
  year = 	 {2009},
}

@InProceedings{infinity09,
  author =      {Morvan, C.},
  title =      {On external presentations of infinite graphs},
  booktitle = {11th International Workshop on Verification of Infinite-State Systems, INFINITY'09},
  series = 	 {{\small EPTCS}},
  volume =	 {10},
  pages =	 {23--35},
  year =      {2009},
  address =      {Bologna, Italy},
  month =      {August}
}

 @InProceedings{morvan:proba,
   author = {N. Bertrand and C. Morvan},
   title = 	 {Probabilistic regular graphs},
   year = 	 {2010},
  booktitle = {12th International Workshop on Verification of Infinite-State Systems, INFINITY'10},
  series = 	 {{\small EPTCS}},
  volume =	 {39},
  pages =	 {77--90},
  address =      {Singapour},
  month =      {August}
 }

@InProceedings{morvan:context10,
  author = 	 {C. Morvan},
  title = 	 {Contextual graph grammars characterising Rational Graphs},
  booktitle = 	 {\rm{\small NCMA}~10},
  pages = 	 {141--153},
  year = 	 {2010},
  volume = 	 {263},
  series = 	 {{\small OCG}},
}

@InProceedings{hvc09,
  author =      {C. Morvan and S. Pinchinat},
  title =      {Diagnosability of pushdown systems},
  booktitle =    {HVC2009, Haifa Verification Conference},
  series = 	 {{\small LNCS}},
  volume =	 {6405},
  pages =	 {21--33},
  year =      {2009},
  address =      {Haifa, Israel},
  month =      {October},
  abstract = {Diagnosis problems of discrete-event systems consist in
                  detecting unobservable defects during system
                  execution. For finite-state systems, the theory is
                  well understood and a number of effective solutions
                  have been developed. For infinite-state systems,
                  however, there are only few results, mostly
                  identifying classes where the problem is
                  undecidable.  We consider higher-order pushdown
                  systems and investigate two basic variants of
                  diagno- sis problems: the diagnosability, which
                  consists in deciding whether defects can be detected
                  within a finite delay, and the bounded-latency
                  problem, which consists in determining a bound for
                  the delay of detecting defects. }
}

@InProceedings{ddmm11,
  author ={Ph. Darondeau and S. Demri and R. Meyer and C. Morvan},
  title ={{Petri Net Reachability Graphs: Decidability Status of FO Properties}},
  booktitle ={IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
  pages ={140--151},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-939897-34-7},
  ISSN ={1868-8969},
  year ={2011},
  volume ={13},
  editor ={S. Chakraborty and A. Kumar},
  annote ={Keywords: Petri nets, First order logic, Reachability graph}
}

@InProceedings{tap12, 
   Author = {Chédor, S. and Jéron, T and Morvan, C.},
   Title = {Test generation from recursive tiles systems},
   BookTitle = {6th International Conference on Tests & Proofs},
   Volume = {7305},
   Pages = {99--114},
   Series = {LNCS},
   Address = {Prague, Czech Republic},
   Month = {June},
   Year = {2012}
}