Skip to main content
Springer Nature Link
Log in

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

  • Conference paper
Language and Automata Theory and Applications (LATA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5457))

Abstract

We study the complexity of identifying (learning) timed automata in the limit from data. In previous work, we showed that in order for timed automata to be efficiently identifiable in the limit, it is necessary that they are deterministic and that they use at most one clock. In this paper, we show this is also sufficient: we provide an algorithm that identifies one-clock deterministic timed automata efficiently in the limit.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Larsen, K.G., Petterson, P., Yi, W.: Uppaal in a nutschell. International journal on software tools for technology transfer 1(1-2), 134–152 (1997)

    Article  Google Scholar 

  3. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302–320 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  4. Pitt, L., Warmuth, M.: The minimum consistent dfa problem cannot be approximated within and polynomial. In: Annual ACM Symposium on Theory of Computing, pp. 421–432. ACM, New York (1989)

    Google Scholar 

  5. Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  6. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol. 1, pp. 49–61. World Scientific, Singapore (1992)

    Chapter  Google Scholar 

  7. de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27(2), 125–138 (1997)

    Article  MATH  Google Scholar 

  8. Verwer, S., de Weerdt, M., Witteveen, C.: Polynomial distinguishability of timed automata. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS, vol. 5278, pp. 238–251. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435–449. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Delft University of Technology, The Netherlands

    Sicco Verwer, Mathijs de Weerdt & Cees Witteveen

Authors
  1. Sicco Verwer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathijs de Weerdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cees Witteveen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain

    Adrian Horia Dediu

  2. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Armand Mihai Ionescu

  3. European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium

    Carlos Martín-Vide

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verwer, S., de Weerdt, M., Witteveen, C. (2009). One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00982-2_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00981-5

  • Online ISBN: 978-3-642-00982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics