Inference of Event-Recording Automata Using Timed Decision Trees

DOI10.1007/11817949_29zbMath1151.68459OpenAlexW1962619228MaRDI QIDQ5756611

Olga Grinchtein, Paul Pettersson, Bengt Jonsson

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817949_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Learning of event-recording automata ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Efficiently identifying deterministic real-time automata from labeled data ⋮ Learning Meets Verification ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ Learning Mealy machines with one timer ⋮ Active learning of timed automata with unobservable resets ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit ⋮ Automata Learning with Automated Alphabet Abstraction Refinement ⋮ Weighted Timed MSO Logics

Uses Software

• Uppaal
• Bandera

This page was built for publication: Inference of Event-Recording Automata Using Timed Decision Trees