@incollection{updatable:expressive:2000,
    Author = {Bouyer, P. and Dufourd, C. and Fleury, E. and Petit, A.},
    BookTitle = {Mathematical Foundations of Computer Science 2000},
    Editor = {Nielsen, Mogens and Rovan, Branislav},
    File = {Expressiveness of Updatable Timed Automata - Bouyer, Dufourd, Fleury, Petit (0) (0) - a - a - d.pdf},
    ISBN = {978-3-540-67901-1},
    Language = {English},
    Pages = {232-242},
    Publisher = {Springer Berlin Heidelberg},
    Series = {Lecture Notes in Computer Science},
    Title = {Expressiveness of Updatable Timed Automata},
    URL = {http://dx.doi.org/10.1007/3-540-44612-5\_19},
    Volume = {1893},
    Year = {2000},
    bdsk-url-1 = {http://dx.doi.org/10.1007/3-540-44612-5\_19},
    date-added = {2014-10-03 12:10:06 +0000},
    date-modified = {2014-10-03 12:10:06 +0000},
    doi = {10.1007/3-540-44612-5_19}
}

@incollection{updatable:expressive:2000, Author = {Bouyer, P. and Dufourd, C. and Fleury, E. and Petit, A.}, BookTitle = {Mathematical Foundations of Computer Science 2000}, Editor = {Nielsen, Mogens and Rovan, Branislav}, File = {Expressiveness of Updatable Timed Automata - Bouyer, Dufourd, Fleury, Petit (0) (0) - a - a - d.pdf}, ISBN = {978-3-540-67901-1}, Language = {English}, Pages = {232-242}, Publisher = {Springer Berlin Heidelberg}, Series = {Lecture Notes in Computer Science}, Title = {Expressiveness of Updatable Timed Automata}, URL = {http://dx.doi.org/10.1007/3-540-44612-5_19}, Volume = {1893}, Year = {2000}, bdsk-url-1 = {http://dx.doi.org/10.1007/3-540-44612-5_19}, date-added = {2014-10-03 12:10:06 +0000}, date-modified = {2014-10-03 12:10:06 +0000}, doi = {10.1007/3-540-44612-5_19} }