BibTeX record conf/concur/KwiatkowskaNS01

download as .bib file

@inproceedings{DBLP:conf/concur/KwiatkowskaNS01,
  author    = {Marta Z. Kwiatkowska and
               Gethin Norman and
               Jeremy Sproston},
  title     = {Symbolic Computation of Maximal Probabilistic Reachability},
  booktitle = {{CONCUR} 2001 - Concurrency Theory, 12th International Conference,
               Aalborg, Denmark, August 20-25, 2001, Proceedings},
  pages     = {169--183},
  year      = {2001},
  crossref  = {DBLP:conf/concur/2001},
  url       = {https://doi.org/10.1007/3-540-44685-0\_12},
  doi       = {10.1007/3-540-44685-0\_12},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/concur/KwiatkowskaNS01},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/concur/2001,
  editor    = {Kim Guldstrand Larsen and
               Mogens Nielsen},
  title     = {{CONCUR} 2001 - Concurrency Theory, 12th International Conference,
               Aalborg, Denmark, August 20-25, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2154},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44685-0},
  doi       = {10.1007/3-540-44685-0},
  isbn      = {3-540-42497-0},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/concur/2001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier