Comparison of expressiveness for timed automata and time Petri nets

Béatrice Bérard*, Franck Cassez, Serge Haddad, Didier Lime, Olivier Henri Roux

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

Original languageEnglish
Title of host publicationCombinatorial optimization and theoretical computer science
EditorsVangelis Th. Paschos
Place of PublicationLondon; Hoboken, NJ
PublisherISTE - Wiley
Pages93-144
Number of pages52
ISBN (Electronic)9780470611098
ISBN (Print)9781848210219
DOIs
Publication statusPublished - 3 Feb 2010
Externally publishedYes

Keywords

  • Corresponding subclasses
  • Finite automata
  • Language acceptance
  • Multimedia applications
  • Real-time systems

Cite this

Bérard, B., Cassez, F., Haddad, S., Lime, D., & Roux, O. H. (2010). Comparison of expressiveness for timed automata and time Petri nets. In V. T. Paschos (Ed.), Combinatorial optimization and theoretical computer science (pp. 93-144). London; Hoboken, NJ: ISTE - Wiley. https://doi.org/10.1002/9780470611098.ch4