An efficient algorithm for learning event-recording automata

DOI10.1007/978-3-642-24372-1_35MaRDI QIDQ3172935zbMATH OpenOpenAlexFDO

Authors Étienne André, Jin-Song Dong, Jun Sun, Yang Liu, Shangwei Lin

Publication date 7 October 2011

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://ink.library.smu.edu.sg/sis_research/5026

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Learning of event-recording automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Inference of timed transition systems
• Inference of Event-Recording Automata Using Timed Decision Trees
• Learning one-clock timed automata

Cited in

(9)

• Model checking approach to automated planning
• Inference of timed transition systems
• 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
• Efficient learning of real time one-counter automata
• Active learning of deterministic timed automata with Myhill-Nerode style characterization
• Learning assumptions for compositional verification of timed automata
• A Myhill-Nerode style characterization for timed automata with integer resets

Describes a project that uses

Uses Software

• PAT

This page was built for publication: An efficient algorithm for learning event-recording automata

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