Updatable timed automata

Patricia Bouyer, C. Dufourd, Emmanuel Fleury, A. Petit

Research output: Contribution to journalJournal articleResearchpeer-review

58 Citations (Scopus)

Abstract

Udgivelsesdato: AUG 16
Original languageEnglish
JournalTheoretical Computer Science
Volume321
Issue number2-3
Pages (from-to)291-345
Number of pages55
ISSN0304-3975
Publication statusPublished - 2004

Cite this

Bouyer, P., Dufourd, C., Fleury, E., & Petit, A. (2004). Updatable timed automata. Theoretical Computer Science, 321(2-3), 291-345.
Bouyer, Patricia ; Dufourd, C. ; Fleury, Emmanuel ; Petit, A. / Updatable timed automata. In: Theoretical Computer Science. 2004 ; Vol. 321, No. 2-3. pp. 291-345.
@article{9d4aee3018d011dca5a4000ea68e967b,
title = "Updatable timed automata",
abstract = "Udgivelsesdato: AUG 16",
author = "Patricia Bouyer and C. Dufourd and Emmanuel Fleury and A. Petit",
year = "2004",
language = "English",
volume = "321",
pages = "291--345",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2-3",

}

Bouyer, P, Dufourd, C, Fleury, E & Petit, A 2004, 'Updatable timed automata', Theoretical Computer Science, vol. 321, no. 2-3, pp. 291-345.

Updatable timed automata. / Bouyer, Patricia; Dufourd, C.; Fleury, Emmanuel; Petit, A.

In: Theoretical Computer Science, Vol. 321, No. 2-3, 2004, p. 291-345.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Updatable timed automata

AU - Bouyer, Patricia

AU - Dufourd, C.

AU - Fleury, Emmanuel

AU - Petit, A.

PY - 2004

Y1 - 2004

N2 - Udgivelsesdato: AUG 16

AB - Udgivelsesdato: AUG 16

M3 - Journal article

VL - 321

SP - 291

EP - 345

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2-3

ER -

Bouyer P, Dufourd C, Fleury E, Petit A. Updatable timed automata. Theoretical Computer Science. 2004;321(2-3):291-345.