BibTeX record conf/concur/BouyerLMST11

• > Home > conf/concur/BouyerLMST11

@inproceedings{DBLP:conf/concur/BouyerLMST11,
  author       = {Patricia Bouyer and
                  Kim G. Larsen and
                  Nicolas Markey and
                  Ocan Sankur and
                  Claus R. Thrane},
  editor       = {Joost{-}Pieter Katoen and
                  Barbara K{\"{o}}nig},
  title        = {Timed Automata Can Always Be Made Implementable},
  booktitle    = {{CONCUR} 2011 - Concurrency Theory - 22nd International Conference,
                  {CONCUR} 2011, Aachen, Germany, September 6-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6901},
  pages        = {76--91},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23217-6\_6},
  doi          = {10.1007/978-3-642-23217-6\_6},
  timestamp    = {Tue, 07 May 2024 20:08:31 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BouyerLMST11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}