BibTeX records: Mathieu Tracol

download as .bib file

@article{DBLP:journals/jcss/ChatterjeeCT16,
  author       = {Krishnendu Chatterjee and
                  Martin Chmelik and
                  Mathieu Tracol},
  title        = {What is decidable about partially observable Markov decision processes
                  with {\(\omega\)}-regular objectives},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {82},
  number       = {5},
  pages        = {878--911},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.jcss.2016.02.009},
  doi          = {10.1016/J.JCSS.2016.02.009},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/ChatterjeeCT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cai/RougemontT13,
  author       = {Michel de Rougemont and
                  Mathieu Tracol},
  editor       = {Traian Muntean and
                  Dimitrios Poulakis and
                  Robert Rolland},
  title        = {Approximation of Large Probabilistic Networks by Structured Population
                  Protocols},
  booktitle    = {Algebraic Informatics - 5th International Conference, {CAI} 2013,
                  Porquerolles, France, September 3-6, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8080},
  pages        = {199--210},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40663-8\_19},
  doi          = {10.1007/978-3-642-40663-8\_19},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/cai/RougemontT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csl/ChatterjeeCT13,
  author       = {Krishnendu Chatterjee and
                  Martin Chmelik and
                  Mathieu Tracol},
  editor       = {Simona Ronchi Della Rocca},
  title        = {What is Decidable about Partially Observable Markov Decision Processes
                  with omega-Regular Objectives},
  booktitle    = {Computer Science Logic 2013 {(CSL} 2013), {CSL} 2013, September 2-5,
                  2013, Torino, Italy},
  series       = {LIPIcs},
  volume       = {23},
  pages        = {165--180},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {https://doi.org/10.4230/LIPIcs.CSL.2013.165},
  doi          = {10.4230/LIPICS.CSL.2013.165},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/csl/ChatterjeeCT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/ChatterjeeCT13,
  author       = {Krishnendu Chatterjee and
                  Martin Chmelik and
                  Mathieu Tracol},
  title        = {What is Decidable about Partially Observable Markov Decision Processes
                  with {\(\omega\)}-Regular Objectives},
  journal      = {CoRR},
  volume       = {abs/1309.2802},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.2802},
  eprinttype    = {arXiv},
  eprint       = {1309.2802},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ChatterjeeCT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/lics/ChatterjeeT12,
  author       = {Krishnendu Chatterjee and
                  Mathieu Tracol},
  title        = {Decidable Problems for Probabilistic Automata on Infinite Words},
  booktitle    = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
                  Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012},
  pages        = {185--194},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/LICS.2012.29},
  doi          = {10.1109/LICS.2012.29},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/ChatterjeeT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Tracol11,
  author       = {Mathieu Tracol},
  title        = {Recurrence and transience for finite probabilistic tables},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {12-14},
  pages        = {1154--1168},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2010.12.038},
  doi          = {10.1016/J.TCS.2010.12.038},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Tracol11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/corr/abs-1107-1206,
  author       = {Mathieu Tracol and
                  Jos{\'{e}}e Desharnais and
                  Abir Zhioua},
  editor       = {Mieke Massink and
                  Gethin Norman},
  title        = {Computing Distances between Probabilistic Automata},
  booktitle    = {Proceedings Ninth Workshop on Quantitative Aspects of Programming
                  Languages, {QAPL} 2011, Saarbr{\"{u}}cken, Germany, April 1-3,
                  2011},
  series       = {{EPTCS}},
  volume       = {57},
  pages        = {148--162},
  year         = {2011},
  url          = {https://doi.org/10.4204/EPTCS.57.11},
  doi          = {10.4204/EPTCS.57.11},
  timestamp    = {Wed, 12 Sep 2018 01:05:14 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-1206.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1104-0127,
  author       = {Krishnendu Chatterjee and
                  Thomas A. Henzinger and
                  Mathieu Tracol},
  title        = {The Decidability Frontier for Probabilistic Automata on Infinite Words},
  journal      = {CoRR},
  volume       = {abs/1104.0127},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.0127},
  eprinttype    = {arXiv},
  eprint       = {1104.0127},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-0127.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1107-2091,
  author       = {Krishnendu Chatterjee and
                  Mathieu Tracol},
  title        = {Decidable Problems for Probabilistic Automata on Infinite Words},
  journal      = {CoRR},
  volume       = {abs/1107.2091},
  year         = {2011},
  url          = {http://arxiv.org/abs/1107.2091},
  eprinttype    = {arXiv},
  eprint       = {1107.2091},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-2091.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/orl/Tracol09,
  author       = {Mathieu Tracol},
  title        = {Fast convergence to state-action frequency polytopes for MDPs},
  journal      = {Oper. Res. Lett.},
  volume       = {37},
  number       = {2},
  pages        = {123--126},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.orl.2008.12.003},
  doi          = {10.1016/J.ORL.2008.12.003},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/orl/Tracol09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/TracolBG09,
  author       = {Mathieu Tracol and
                  Christel Baier and
                  Marcus Gr{\"{o}}{\ss}er},
  editor       = {Ravi Kannan and
                  K. Narayan Kumar},
  title        = {Recurrence and Transience for Probabilistic Automata},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
                  {IIT} Kanpur, India},
  series       = {LIPIcs},
  volume       = {4},
  pages        = {395--406},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2009},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2335},
  doi          = {10.4230/LIPICS.FSTTCS.2009.2335},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/TracolBG09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/lics/RougemontT09,
  author       = {Michel de Rougemont and
                  Mathieu Tracol},
  title        = {Statistic Analysis for Probabilistic Processes},
  booktitle    = {Proceedings of the 24th Annual {IEEE} Symposium on Logic in Computer
                  Science, {LICS} 2009, 11-14 August 2009, Los Angeles, CA, {USA}},
  pages        = {299--308},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/LICS.2009.36},
  doi          = {10.1109/LICS.2009.36},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/RougemontT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/qest/DesharnaisLT08,
  author       = {Jos{\'{e}}e Desharnais and
                  Fran{\c{c}}ois Laviolette and
                  Mathieu Tracol},
  title        = {Approximate Analysis of Probabilistic Processes: Logic, Simulation
                  and Games},
  booktitle    = {Fifth International Conference on the Quantitative Evaluaiton of Systems
                  {(QEST} 2008), 14-17 September 2008, Saint-Malo, France},
  pages        = {264--273},
  publisher    = {{IEEE} Computer Society},
  year         = {2008},
  url          = {https://doi.org/10.1109/QEST.2008.42},
  doi          = {10.1109/QEST.2008.42},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/qest/DesharnaisLT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.