IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems

  • Étienne André
  • Laurent Fribourg
  • Ulrich Kühne
  • Romain Soulat
Conference paper

DOI: 10.1007/978-3-642-32759-9_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7436)
Cite this paper as:
André É., Fribourg L., Kühne U., Soulat R. (2012) IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. In: Giannakopoulou D., Méry D. (eds) FM 2012: Formal Methods. FM 2012. Lecture Notes in Computer Science, vol 7436. Springer, Berlin, Heidelberg

Abstract

The tool Imitator implements the Inverse Method (IM) for Timed Automata (TAs). Given a TA \(\mathcal{A}\) and a tuple π0 of reference valuations for timings, IM synthesizes a constraint around π0 where \(\mathcal{A}\) behaves in the same discrete manner. This provides us with a quantitative measure of robustness of the behavior of \(\mathcal{A}\) around π0. The new version Imitator 2.5 integrates the new features of stopwatches (in addition to standard clocks) and updates (in addition to standard clock resets), as well as powerful algorithmic improvements for state space reduction. These new features make the tool well-suited to analyze the robustness of solutions in several classes of preemptive scheduling problems.

Keywords

Real-Time Systems Parametric Timed Automata Stopwatches 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Étienne André
    • 1
  • Laurent Fribourg
    • 2
  • Ulrich Kühne
    • 3
  • Romain Soulat
    • 2
  1. 1.LIPN, CNRS UMR 7030Université Paris 13France
  2. 2.LSV – ENS Cachan & CNRSFrance
  3. 3.Universität BremenGermany

Personalised recommendations