Inference of timed transition systems

MaRDI QIDQ2851066zbMATH OpenFDO

Authors Olga Grinchtein, Martin Leucker, Bengt Jonsson

Publication date 2 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105052023

Mathematics Subject Classification ID

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

Recommendations

• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Learning of event-recording automata
• An efficient algorithm for learning event-recording automata
• Inference of Event-Recording Automata Using Timed Decision Trees
• Learning one-clock timed automata

Cited in

(7)

• Learning deterministic probabilistic automata from a model checking perspective
• An efficient algorithm for learning event-recording automata
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• scientific article; zbMATH DE number 1104351 (Why is no real title available?)
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Inference of Event-Recording Automata Using Timed Decision Trees
• Learning of event-recording automata

This page was built for publication: Inference of timed transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851066)