1. 2011
  2. Learning Driving Behavior By Timed Syntactic Pattern Recognition

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2011, Proceedings of the International Joint Conference on Artificial Intelligence. Walsh, T. (ed.). American Association for Artificial Intelligence (AAAI), p. 1529-1534 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  3. The efficiency of identifying timed automata and the power of clocks

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2011, In : Information and Computation. 209, 3, p. 606-625 20 p.

    Research output: Contribution to journalArticleScientificpeer-review

  4. 2010
  5. A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2010, Grammatical Inference: Theoretical Results and Applications. Sempere, JM. & García, P. (eds.). Berlin: Springer, p. 203-216 14 p. (Lecture Notes in Computer Science; vol. 6339).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  6. Efficient Identification of Timed Automata: Theory and Practice

    Verwer, SE., 2010, Delft. 252 p.

    Research output: ThesisDissertation (TU Delft)Scientific

  7. Exact DFA Identification Using SAT Solvers

    Heule, MJH. & Verwer, SE., 2010, Grammatical Inference: Theoretical Results and Applications 10th International Colloquium, ICGI 2010. Sempere, JM. & García, P. (eds.). Berlin: Springer, p. 66-79 14 p. (Lecture Notes in Computer Science; vol. 6339).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  8. 2009
  9. One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2009, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings. Dediu, AH., Ionescu, AM. & Martin-Vide, C. (eds.). Berlin: Springer, p. 740-751 12 p. (Lecture Notes in Computer Science; vol. 5457).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  10. Using a satisfiability solver to identify deterministic finite state automata

    Heule, MJH. & Verwer, SE., 2009, BNAIC 2009 Benelux Conference on Artificial Intelligence. Calders, T., Tuyls, K. & Pechenizkiy, M. (eds.). Eindhoven: BNAIC, p. 91-98 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  11. 2008
  12. Efficiently learning simple timed automata

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2008, Induction of Process Models (IPM 2008). Bridewell, W., Calders, T., de Medeiros, A. K., Kramer, S., Pechenizkiy, M. & Todorovski, L. (eds.). Antwerp: University of Antwerp, p. 61-68 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  13. Efficiently learning timed models from observations

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2008, Benelearn 2008. Wehenkel, L., Geurts, P. & Maree, R. (eds.). Luik: University of Liege, p. 75-76 2 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  14. Polynomial distinguishability of timed automata

    Verwer, SE., de Weerdt, MM. & Witteveen, C., 2008, ICGI. Clark, A., Coste, F. & Miclet, L. (eds.). Springer, p. 238-251 14 p. (Lecture Notes in Artificial Intelligence; vol. 5278).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

ID: 172770