On MITL and alternating timed automata over infinite words

October 17, 2017 in by

by Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts
Reference:
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts. On MITL and alternating timed automata over infinite words. In Proceedings of the 12th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS’14), pages 69-84. Volume 8711 of Lecture Notes in Computer Science. Springer, September 2014.
Bibtex Entry:
@string{sep="September"}
@inproceedings{BEG-formats14,
  address =       {Florence, Italy},
  author =        {Brihaye, Thomas and Esti{'e}venart, Morgane and
                   Geeraerts, Gilles},
  booktitle =     {{P}roceedings of the 12th {I}nternational
                   {C}onference on {F}ormal {M}odelling and {A}nalysis
                   of {T}imed {S}ystems ({FORMATS}'14)},
  editor =        {Legay, Axel and Bozga, Marius},
  month =         sep,
  pages =         {69-84},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {On~{MITL} and alternating timed automata over
                   infinite words},
  volume =        {8711},
  year =          {2014},
  doi =           {10.1007/978-3-319-10512-3_6},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  BEG-formats14.pdf},
  category =      {conf},
  wps =           {wp1},
  partners =      {UMONS and ULB},
  casstingpart =  {100},
}