460
J. An et al.
References
1. Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.W.: Learning register automata with fresh value generation. In: Leucker, M., Rueda, C., Valencia, F.D.
(eds.) ICTAC 2015. LNCS, vol. 9399, pp. 165–183. Springer, Heidelberg (2015).
https://doi.org/10.1007/978-3-319-25150-9 11
2. Aarts, F., Vaandrager, F.W.: Learning I/O automata. In: Gastin, P., Laroussinie, F.
(eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71–85. Springer, Heidelberg (2010).
https://doi.org/10.1007/978-3-642-15375-4 6
3. Abdullah, J., Dai, G., Mohaqeqi, M., Yi, W.: Schedulability analysis and software synthesis
for graph-based task models with resource sharing. In: Proceedings of 24th IEEE Real-Time
and Embedded Technology and Applications Symposium, RTAS 2018. pp. 261–270. IEEE
Computer Society (2018)
4. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
5. Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed
automata. Theor. Comput. Sci. 211(1-2), 253–273 (1999)
6. Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo,
M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1–24. Springer, Heidelberg
(2004). https://doi.org/10.1007/978-3-540-30080-9 1
7. An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata (full
version). arXiv:1910.10680 (2019), https://arxiv.org/abs/1910.10680
8. An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata.
Figshare (2020), https://doi.org/10.6084/m9.figshare.11545983.v3
9. An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. SCIENCE
CHINA Information Sciences (2020). https://doi.org/10.1007/s11432-019-2767-4, to appear.
10. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2),
87–106 (1987)
11. Argyros, G., D’Antoni, L.: The learnability of symbolic automata. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 427–445. Springer, Heidelberg
(2018). https://doi.org/10.1007/978-3-319-96145-3 23
12. Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009.
pp. 1004–1009. AAAI Press (2009)
13. Bollig, B., Katoen, J.P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.:
libalf: The automata learning framework. In: Touili, T., Cook, B., Jackson, P.B.
(eds.) CAV 2010. LNCS, vol. 6174, pp. 360–364. Springer, Heidelberg (2010).
https://doi.org/10.1007/978-3-642-14295-6 32
14. Caldwell, B., Cardell-Oliver, R., French, T.: Learning time delay Mealy machines from programmable logic controllers. IEEE Trans. Automation Science and Engineering 13(2), 1155–
1164 (2016)
15. Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Asp. Comput. 28(2), 233–263 (2016)
16. Denning, D.E., Sacco, G.M.: Timestamps in key distribution protocols. Communications of
the ACM 24(8), 533–536 (1981)
17. Dima, C.: Real-time automata. Journal of Automata, Languages and Combinatorics 6(1),
3–23 (2001)
18. Drews, S., D’Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T.
(eds.) TACAS 2017. LNCS, vol. 10205, pp. 173–189. Springer, Heidelberg (2017).
https://doi.org/10.1007/978-3-662-54577-5 10
J. An et al.
References
1. Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.W.: Learning register automata with fresh value generation. In: Leucker, M., Rueda, C., Valencia, F.D.
(eds.) ICTAC 2015. LNCS, vol. 9399, pp. 165–183. Springer, Heidelberg (2015).
https://doi.org/10.1007/978-3-319-25150-9 11
2. Aarts, F., Vaandrager, F.W.: Learning I/O automata. In: Gastin, P., Laroussinie, F.
(eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71–85. Springer, Heidelberg (2010).
https://doi.org/10.1007/978-3-642-15375-4 6
3. Abdullah, J., Dai, G., Mohaqeqi, M., Yi, W.: Schedulability analysis and software synthesis
for graph-based task models with resource sharing. In: Proceedings of 24th IEEE Real-Time
and Embedded Technology and Applications Symposium, RTAS 2018. pp. 261–270. IEEE
Computer Society (2018)
4. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
5. Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed
automata. Theor. Comput. Sci. 211(1-2), 253–273 (1999)
6. Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo,
M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1–24. Springer, Heidelberg
(2004). https://doi.org/10.1007/978-3-540-30080-9 1
7. An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata (full
version). arXiv:1910.10680 (2019), https://arxiv.org/abs/1910.10680
8. An, J., Chen, M., Zhan, B., Zhan, N., Zhang, M.: Learning one-clock timed automata.
Figshare (2020), https://doi.org/10.6084/m9.figshare.11545983.v3
9. An, J., Wang, L., Zhan, B., Zhan, N., Zhang, M.: Learning real-time automata. SCIENCE
CHINA Information Sciences (2020). https://doi.org/10.1007/s11432-019-2767-4, to appear.
10. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2),
87–106 (1987)
11. Argyros, G., D’Antoni, L.: The learnability of symbolic automata. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 427–445. Springer, Heidelberg
(2018). https://doi.org/10.1007/978-3-319-96145-3 23
12. Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009.
pp. 1004–1009. AAAI Press (2009)
13. Bollig, B., Katoen, J.P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.:
libalf: The automata learning framework. In: Touili, T., Cook, B., Jackson, P.B.
(eds.) CAV 2010. LNCS, vol. 6174, pp. 360–364. Springer, Heidelberg (2010).
https://doi.org/10.1007/978-3-642-14295-6 32
14. Caldwell, B., Cardell-Oliver, R., French, T.: Learning time delay Mealy machines from programmable logic controllers. IEEE Trans. Automation Science and Engineering 13(2), 1155–
1164 (2016)
15. Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Asp. Comput. 28(2), 233–263 (2016)
16. Denning, D.E., Sacco, G.M.: Timestamps in key distribution protocols. Communications of
the ACM 24(8), 533–536 (1981)
17. Dima, C.: Real-time automata. Journal of Automata, Languages and Combinatorics 6(1),
3–23 (2001)
18. Drews, S., D’Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T.
(eds.) TACAS 2017. LNCS, vol. 10205, pp. 173–189. Springer, Heidelberg (2017).
https://doi.org/10.1007/978-3-662-54577-5 10