2011
DOI: 10.1007/s10994-011-5265-4
|View full text |Cite
|
Sign up to set email alerts
|

Efficiently identifying deterministic real-time automata from labeled data

Abstract: We develop a novel learning algorithm RTI for identifying a deterministic realtime automaton (DRTA) from labeled time-stamped event sequences. The RTI algorithm is based on the current state of the art in deterministic finite-state automaton (DFA) identification, called evidence-driven state-merging (EDSM). In addition to having a DFA structure, a DRTA contains time constraints between occurrences of consecutive events. Although this seems a small difference, we show that the problem of identifying a DRTA is m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(7 citation statements)
references
References 25 publications
0
7
0
Order By: Relevance
“…Several works proposed different state-merging algorithms; Recently, Mediouni et al provided an improvement on the RTI algorithm that was proposed in [27] and with this improvement, the algorithm can learn more accurate models [13]. Pastore et al proposed the TkT algorithm that computes š‘˜ number of transitions for each state š‘  from the initial state machine model.…”
Section: State-merging Algorithmsmentioning
confidence: 99%
“…Several works proposed different state-merging algorithms; Recently, Mediouni et al provided an improvement on the RTI algorithm that was proposed in [27] and with this improvement, the algorithm can learn more accurate models [13]. Pastore et al proposed the TkT algorithm that computes š‘˜ number of transitions for each state š‘  from the initial state machine model.…”
Section: State-merging Algorithmsmentioning
confidence: 99%
“…Some other modeling formalisms for which learning algorithms have been developed include: Nondeterministic auotmata [90,91], Probabilistic automata [92,93], Petri-nets [94], Timed automata (learning timed systems 10 in active learning framework) [95,96], Buchi automata [97] and I/O automata [27].…”
Section: Miscellaneous Formalismsmentioning
confidence: 99%
“…In [134], Verwer, de Weerdt, and Witteveen present a deterministic real-time automaton (DRTA) learning algorithm, real-time identification (RTI) algorithm, utilizing event sequences that were labeled and time-stamped. The algorithm merges states based on the evidence to identify a deterministic finite-state automaton (DFA).…”
Section: Timed Automatamentioning
confidence: 99%