IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata

  • Étienne André
Conference paper

DOI: 10.1007/978-3-642-03466-4_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5684)
Cite this paper as:
André É. (2009) IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata. In: Leucker M., Morgan C. (eds) Theoretical Aspects of Computing - ICTAC 2009. ICTAC 2009. Lecture Notes in Computer Science, vol 5684. Springer, Berlin, Heidelberg

Abstract

We present here Imitator, a tool for synthesizing constraints on timing bounds (seen as parameters) in the framework of timed automata. Unlike classical synthesis methods, we take advantage of a given reference valuation of the parameters for which the system is known to behave properly. Our aim is to generate a constraint such that, under any valuation satisfying this constraint, the system is guaranteed to behave, in terms of alternating sequences of locations and actions, as under the reference valuation. This is useful for safely relaxing some values of the reference valuation, and optimizing timing bounds of the system. We have successfully applied our tool to various examples of asynchronous circuits and protocols.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Étienne André
    • 1
  1. 1.LSV – ENS de Cachan & CNRSFrance

Personalised recommendations