A conformance testing relation for symbolic timed automata

  • Authors:
  • Sabrina Von Styp;Henrik Bohnenkamp;Julien Schmaltz

  • Affiliations:
  • Software Modeling and Verification, Department of Computer Science, RWTH Aachen University, Aachen, Germany;Software Modeling and Verification, Department of Computer Science, RWTH Aachen University, Aachen, Germany;School of Computer Science, Open University of the Netherlands, Heerlen, The Netherlands and Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands

  • Venue:
  • FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

We introduce Symbolic Timed Automata, an amalgamation of symbolic transition systems and timed automata, which allows to express nondeterministic data-dependent control flow with inputs and outputs and real-time behaviour. In particular, input data can influence the timing behaviour. We define two semantics for STA, a concrete one as timed labelled transition systems and another one on a symbolic level. We show that the symbolic semantics is complete and correct w.r.t. the concrete one. Finally, we introduce symbolic conformance relation stioco, which is an extension of the well-known ioco conformance relation. Relation stioco is defined using FO-logic on a purely symbolic level. We show that stioco corresponds on the concrete semantic level to Krichen and Tripakis' implementation relation tioco for timed labelled transition systems.