IMITATOR: A tool for synthesizing constraints on timing bounds of timed automata

11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

André, É. (2009). IMITATOR: A tool for synthesizing constraints on timing bounds of timed automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5684 LNCS, pp. 336–342). https://doi.org/10.1007/978-3-642-03466-4_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free