IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems

  • Étienne André
  • Laurent Fribourg
  • Ulrich Kühne
  • Romain Soulat
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7436)

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.

References

  1. 1.
  2. 2.
    Abdeddaïm, Y., Maler, O.: Preemptive Job-Shop Scheduling Using Stopwatch Automata. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 113–126. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    André, É.: IMITATOR II: A tool for solving the good parameters problem in timed automata. In: INFINITY. EPTCS, vol. 39, pp. 91–99 (2010)Google Scholar
  4. 4.
    André, É., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. International Journal of Foundations of Computer Science 20(5), 819–836 (2009)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    André, É., Fribourg, L., Soulat, R.: Enhancing the Inverse Method with State Merging. In: Goodloe, A.E., Person, S. (eds.) NFM 2012. LNCS, vol. 7226, pp. 100–105. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  6. 6.
    Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming 72(1–2), 3–21 (2008)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Beyond Liveness: Efficient Parameter Synthesis for Time Bounded Liveness. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 81–94. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Bini, E., Buttazzo, G.C.: Schedulability analysis of periodic fixed priority systems. IEEE Trans. Computers 53(11), 1462–1473 (2004)CrossRefGoogle Scholar
  9. 9.
    Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: RTSS, pp. 80–89. IEEE Computer Society, Washington, DC (2008)Google Scholar
  10. 10.
    Fribourg, L., Lesens, D.: Projet ROSCOV: Robuste ordonnancement de systèmes de contrôle de vol. Project report (December 2011)(in French), http://www.farman.ens-cachan.fr/ROSCOV.pdf
  11. 11.
    Henzinger, T.A., Ho, P.H., Wong-Toi, H.: Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer 1, 460–463 (1997)Google Scholar
  12. 12.
    Le, T., Palopoli, L., Passerone, R., Ramadian, Y., Cimatti, A.: Parametric analysis of distributed firm real-time systems: A case study. In: ETFA, pp. 1–8 (2010)Google Scholar
  13. 13.
    Lime, D., Roux, O.H., Seidner, C., Traonouez, L.-M.: Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 54–57. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Markey, N.: Robustness in real-time systems. In: SIES, pp. 28–34. IEEE (2011)Google Scholar
  15. 15.
    Soulat, R.: Scheduling with IMITATOR: Some case studies. Research Report LSV-12-05, Laboratoire Spécification et Vérification, France (March 2012), http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2012-05.pdf
  16. 16.
    Sun, J., Gardner, M.K., Liu, J.W.S.: Bounding completion times of jobs with arbitrary release times, variable execution times, and resource sharing. IEEE Trans. Softw. Eng. 23, 603–615 (1997)CrossRefGoogle Scholar

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