Jump to : Download | Contact | BibTex reference | EndNote reference |

BLMST-concur11

Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus Thrane. Timed automata can always be made implementable. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), Joost-Pieter Katoen, Barbara König (eds.), Lecture Notes in Computer Science, Volume 6901, Pages 76-91, Aachen, Germany, September 2011.

Download [help]

Download paper: Doi page

Download paper: Adobe portable document (pdf) pdf

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic

Contact

Ocan Sankur http://people.irisa.fr/Ocan.Sankur/

BibTex Reference

@InProceedings{BLMST-concur11,
   Author = {Bouyer, Patricia and Larsen, Kim G. and Markey, Nicolas and Sankur, Ocan and Thrane, Claus},
   Title = {Timed automata can always be made implementable},
   BookTitle = {{P}roceedings of the 22nd {I}nternational {C}onference on {C}oncurrency {T}heory ({CONCUR}'11)},
   editor = {Katoen, Joost-Pieter and König, Barbara},
   Volume = {    6901},
   Pages = {76--91},
   Series = {Lecture Notes in Computer Science},
   Publisher = {Springer},
   Address = {Aachen, Germany},
   Month = {September},
   Year = {2011}
}

EndNote Reference [help]

Get EndNote Reference (.ref)