@comment{{B-arxiv16,
  author =		Bollig, Benedikt, 
  affiliation = 	aff-LSVmexico,
  title =    		One-Counter Automata with Counter Visibility, 
  institution = 	Computing Research Repository, 
  number =    		1602.05940, 
  month = 		feb, 
  nmonth =     		2,
  year = 		2016, 
  type = 		RR, 
  axeLSV = 		mexico,
  NOcontrat = 		"",
  
  url =			http://arxiv.org/abs/1602.05940, 
  PDF =			"http://www.lsv.fr/Publis/PAPERS/PDF/B-arxiv16.pdf",
  lsvdate-new =  	20160222,
  lsvdate-upd =  	20160222,
  lsvdate-pub =  	20160222,
  lsv-category = 	"rapl",
  wwwpublic =    	"public and ccsb",
  note = 		18~pages, 

  abstract = "In a one-counter automaton (OCA), one can read a letter
    from some finite alphabet, increment and decrement the counter by
    one, or test it for zero. It is well-known that universality and
    language inclusion for OCAs are undecidable. We consider here OCAs
    with counter visibility: Whenever the automaton produces a letter,
    it outputs the current counter value along with~it. Hence, its
    language is now a set of words over an infinite alphabet. We show
    that universality and inclusion for that model are in PSPACE, thus
    no harder than the corresponding problems for finite automata, which
    can actually be considered as a special case. In fact, we show that
    OCAs with counter visibility are effectively determinizable and
    closed under all boolean operations. As~a~strict generalization, we
    subsequently extend our model by registers. The general nonemptiness
    problem being undecidable, we impose a bound on the number of
    register comparisons and show that the corresponding nonemptiness
    problem is NP-complete.",
}}

@inproceedings{CHMNP-fun16,
  address = {La Maddalena, Italy},
  series = {Leibniz International Proceedings in Informatics},
  volume = {49},
  month = jun,
  year = 2016,
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  editor = {Erik D. Demaine and Fabrizio Grandoni},
  acronym = {{FUN}'16},
  booktitle = {{P}roceedings of the 8th {I}nternational
               {C}onference on {F}un with {A}lgorithms
               ({FUN}'16)},
  author = {Nathann Cohen and
               Mathieu Hilaire and
               N{\'{\i}}colas A. Martins and
               Nicolas Nisse and
               St{\'{e}}phane P{\'{e}}rennes},
  title = {Spy-Game on Graphs},
  pages = {10:1-10:16},
  url = {https://doi.org/10.4230/LIPIcs.FUN.2016.10},
  pdf = {http://drops.dagstuhl.de/opus/volltexte/2016/5878/pdf/18.pdf},
  doi = {10.4230/LIPIcs.FUN.2016.10}
}

@mastersthesis{m2-Hilaire,
  author = {Hilaire, Mathieu},
  title = {{Complexity of the reachability problem for parametric timed automata}},
  school = {{M}aster {P}arisien de {R}echerche en 
	{I}nformatique, Paris, France},
  type = {Rapport de {M}aster},
  year = {2018},
  month = sep,
  pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hilaire-M2-2018.pdf}
}

@inproceedings{GH-stacs21,
  address = {Saarbr{\"u}cken, Germany},
  month = mar,
  volume = {187},
  series = {Leibniz International Proceedings in Informatics},
  publisher = {Leibniz-Zentrum f{\"u}r Informatik},
  editor = {Markus Bl{\"a}ser and Benjamin Monmege},
  acronym = {{STACS}'21},
  booktitle = {{P}roceedings of the 38th {A}nnual
               {S}ymposium on {T}heoretical {A}spects of
               {C}omputer {S}cience
               ({STACS}'21)},
  author = {G{\"o}ller, Stefan and Hilaire, Mathieu},
  title = {{Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete}},
  year = {2021},
  doi = {10.4230/LIPIcs.STACS.2021.36},
  pdf = {https://drops.dagstuhl.de/opus/volltexte/2021/13681/pdf/LIPIcs-STACS-2021-36.pdf},
  url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13681}
}

This file was generated by bibtex2html 1.98.