You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Inference of Event-Recording Automata using Timed Decision Trees

Authors:

Olga Grinchtein , Bengt Jonsson , Paul Pettersson

Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of the 17th International Conference on Concurrency Theory (CONCUR06)

Publisher:

Springer-Verlag


Abstract

We present an algorithm for inferring a timed-automaton model of a system from information obtained by observing its external behavior. Since timed automata can not in general be determinized, we restrict our attention to systems that can be described by deterministic event-recording automata. In previous work we have presented algorithms for event-recording automata that satisfy the restriction that there is at most one transition per alphabet symbol from each state. This restriction was lifted in subsequent work by an algorithm based on the region graph. In this paper, we extend previous work by considering the full class of event-recording automata, while still avoiding to base it on the (usually prohibitively large) region graph. Our construction deviates from previous work on inference of automata in that it first constructs a so called timed decision tree from observations of system behavior, which is thereafter folded into an automaton.

Bibtex

@inproceedings{Grinchtein1040,
author = {Olga Grinchtein and Bengt Jonsson and Paul Pettersson},
title = {Inference of Event-Recording Automata using Timed Decision Trees},
editor = {Christel Baier and Holger Hermanns},
pages = {435--449},
month = {August},
year = {2006},
booktitle = {Proceedings of the 17th International Conference on Concurrency Theory (CONCUR06)},
publisher = {Springer-Verlag},
url = {http://www.es.mdh.se/publications/1040-}
}