Sökning: onr:"swepub:oai:DiVA.org:mdh-6989" >
Inference of Event-...
Inference of Event-Recording Automata using Timed Decision Trees
-
- Grinchtein, Olga (författare)
- Uppsala University, Sweden
-
- Jonsson, Bengt (författare)
- Uppsala University, Sweden
-
- Pettersson, Paul (författare)
- Uppsala University, Sweden
-
(creator_code:org_t)
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2006
- 2006
- Engelska.
-
Ingår i: CONCUR 2006 – Concurrency Theory. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540373766 ; , s. 435-449
- Relaterad länk:
-
http://www.it.uu.se/...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas