An efficient algorithm for learning event-recording automata
DOI10.1007/978-3-642-24372-1_35zbMATH Open1348.68077OpenAlexW135782543MaRDI QIDQ3172935FDOQ3172935
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
Recommendations
Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (7)
- Inference of timed transition systems
- Inference of Event-Recording Automata Using Timed Decision Trees
- Model checking approach to automated planning
- Efficient learning of real time one-counter automata
- Learning of event-recording automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Learning assumptions for compositional verification of timed automata
Uses Software
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)