The efficiency of identifying timed automata and the power of clocks
From MaRDI portal
Publication:553334
DOI10.1016/j.ic.2010.11.023zbMath1217.68134OpenAlexW2170987619MaRDI QIDQ553334
Mathijs de Weerdt, Cees Witteveen, Sicco Verwer
Publication date: 27 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:1b229891-aed4-4def-b022-c4dab1b94b08
Related Items (5)
Learning One-Clock Timed Automata ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Efficiently identifying deterministic real-time automata from labeled data ⋮ Inferring switched nonlinear dynamical systems
Uses Software
Cites Work
- Unnamed Item
- Teaching a smarter learner.
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Characteristic sets for polynomial grammatical inference
- Uppaal in a nutshell
- On polynomial-time learnability in the limit of strictly deterministic automata
- Timed regular expressions
- Complexity of automaton identification from given data
- Minimal NFA Problems are Hard
- CONCUR 2004 - Concurrency Theory
- Language identification in the limit
- Inference of Event-Recording Automata Using Timed Decision Trees
This page was built for publication: The efficiency of identifying timed automata and the power of clocks
