Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes

October 15, 2017 in by

by Aaron Bohy, Véronique Bruyère, Jean-François Raskin
Reference:
Aaron Bohy, Véronique Bruyère, Jean-François Raskin. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. In Proceedings of the 3rd Workshop on Synthesis (SYNT’14), pages 51-67. Volume 157 of Electronic Proceedings in Theoretical Computer Science. July 2014.
Bibtex Entry:
@string{jul="July"}
@inproceedings{BBR-synt14,
  address =       {Vienna, Austria},
  author =        {Aaron Bohy and V{'e}ronique Bruy{`e}re and
                   Jean-Fran{c c}ois Raskin},
  booktitle =     {{P}roceedings of the 3rd {W}orkshop on {S}ynthesis
                   ({SYNT}'14)},
  editor =        {Chatterjee, Krishnendu and Ehlers, R{"u}diger and
                   Jha, Susmit},
  month =         jul,
  pages =         {51-67},
  series =        {Electronic Proceedings in Theoretical Computer
                   Science},
  title =         {Symblicit algorithms for mean-payoff and shortest
                   path in monotonic Markov decision processes},
  volume =        {157},
  year =          {2014},
  doi =           {},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BBR-synt14.pdf},
  category =      {conf},
  wps =           {wp2},
  partners =      {UMONS and ULB},
  casstingpart =  {25},
}