Deciding the value 1 problem for reachability in one-clock decision stochastic timed automata

October 17, 2017 in by

by Nathalie Bertrand, Thomas Brihaye, Blaise Genest
Reference:
Nathalie Bertrand, Thomas Brihaye, Blaise Genest. Deciding the value 1 problem for reachability in one-clock decision stochastic timed automata. In Proceedings of the 11th International Cconference on Quantitative Evaluation of Systems (QEST’14), pages 313-328. IEEE Comp. Soc. Press, September 2014.
Bibtex Entry:
@string{sep="September"}
@inproceedings{BBG-qest14,
  address =       {Florence, Italy},
  author =        {Bertrand, Nathalie and Brihaye, Thomas and
                   Genest, Blaise},
  booktitle =     {{P}roceedings of the 11th {I}nternational
                   {C}conference on {Q}uantitative {E}valuation of
                   {S}ystems ({QEST}'14)},
  editor =        {Norman, Gethin and Sanders, William H.},
  month =         sep,
  pages =         {313-328},
  publisher =     {IEEE Comp. Soc. Press},
  title =         {Deciding the value~(1) problem for reachability in
                   one-clock decision stochastic timed automata},
  year =          {2014},
  doi =           {10.1007/978-3-319-10696-0_25},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BBG-qest14.pdf},
  category =      {conf},
  wps =           {wp2},
  partners =      {UMONS},
  casstingpart =  {100},
}