4. Comparison of Expressiveness for Timed Automata and Time Petri Nets

  1. Vangelis Th. Paschos
  1. Béatrice Bérard,
  2. Franck Cassez,
  3. Serge Haddad,
  4. Didier Lime and
  5. Olivier-Henri Roux

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch4

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Bérard, B., Cassez, F., Haddad, S., Lime, D. and Roux, O.-H. (2008) Comparison of Expressiveness for Timed Automata and Time Petri Nets, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch4

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • multimedia applications;
  • finite automata;
  • real-time systems;
  • corresponding subclasses;
  • language acceptance

Summary

This chapter contains sections titled:

  • Introduction

  • Time Petri nets and timed automata

  • Comparison of semantics I, A and PA

  • Strict ordering results

  • Equivalence with respect to timed language acceptance

  • Bisimulation of TA by TPNs

  • Conclusion

  • Bibliography