Polynomial Time Decidability of Weighted Synchronization under Partial Observability

October 17, 2017 in by

by Jan Kretínský, Kim G. Larsen, Simon Laursen, Jiří Srba
Reference:
Jan Kretínský, Kim G. Larsen, Simon Laursen, Jiří Srba. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR’15), pages 142-154. Volume 42 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015.
Bibtex Entry:
@string{sep="September"}
@inproceedings{KLLS-concur15,
  address =       {Madrid, Spain},
  author =        {Kret{'i}nsk{'y}, Jan and Larsen, Kim G. and
                   Laursen, Simon and Srba, Ji{v{r}}{'i}},
  booktitle =     {{P}roceedings of the 26th {I}nternational
                   {C}onference on {C}oncurrency {T}heory ({CONCUR}'15)},
  editor =        {Aceto, Luca and de Frutos Escrig, David},
  month =         sep,
  pages =         {142-154},
  publisher =     {Leibniz-Zentrum f{"u}r Informatik},
  series =        {Leibniz International Proceedings in Informatics},
  title =         {Polynomial Time Decidability of Weighted
                   Synchronization under Partial Observability},
  volume =        {42},
  year =          {2015},
  doi =           {10.4230/LIPIcs.CONCUR.2015.142},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  KLLS-concur15.pdf},
  category =      {conf},
  wps =           {wp2},
  partners =      {AAU},
  casstingpart =  {50},
}