SwePub - search: onr:"swepub:oai:gup.ub.gu.se/3...

Enumeration	Reference	Cover	Find
1.	Grinchtein, Olga, et al. (author) Inference of Event-Recording Automata using Timed Decision Trees 2006 In: CONCUR 2006 – Concurrency Theory. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540373766 ; , s. 435-449 Conference paper (peer-reviewed)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.

Grinchtein, Olga, et al. (author)
Inference of Event-Recording Automata using Timed Decision Trees
2006
In: CONCUR 2006 – Concurrency Theory. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540373766 ; , s. 435-449
Conference paper (peer-reviewed)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.

Träfflista för sökning "onr:"swepub:oai:gup.ub.gu.se/306258" "