Timed CSP = closed timed ε-automata

  • Authors:
  • Joël Ouaknine;James Worrell

  • Affiliations:
  • Computer Science Department, Carnegie Mellon University 5000 Forbes Ave., Pittsburgh PA;Department of Mathematics, Tulane University 6823 St. Charles Ave., New Orleans LA

  • Venue:
  • Nordic Journal of Computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose some mild modifications to the syntax and semantics of Timed CSP which significantly increase expressiveness. As a result, we are able to capture some of the most widely used specifications on timed systems as refinements (reverse inclusion of sets of behaviours) which may then be verified using the model checker FDR. We characterize the expressive power of the finite-state fragment of this augmented version of Timed CSP as that of closed timed ε-automata--timed automata with ε-transitions (silent transitions) and closed invariant and enabling clock constraints.