{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:34Z","timestamp":1740108334192,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00236-023-00442-8","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T18:02:22Z","timestamp":1689616942000},"page":"361-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Testing membership for timed automata"],"prefix":"10.1007","volume":"60","author":[{"given":"Richard","family":"Lassaigne","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6518-8874","authenticated-orcid":false,"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"issue":"6","key":"442_CR1","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N Alon","year":"2000","unstructured":"Alon, N., Krivelich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM J. Comput. 30(6), 1842\u20131862 (2000)","journal-title":"SIAM J. Comput."},{"key":"442_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"442_CR3","unstructured":"Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 2\u20134, 1998, pp 254\u2013263, (1998)"},{"key":"442_CR4","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2005","unstructured":"Alur, R., Torre, S.L., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) Hybrid Systems: Computation and Control. Springer, Berlin Heidelberg (2005)"},{"key":"442_CR5","first-page":"1","volume-title":"Decision Problems for Timed Automata: A Survey","author":"R Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey, pp. 1\u201324. Springer, Berlin Heidelberg (2004)"},{"issue":"1","key":"442_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"C","key":"442_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ic.2015.03.003","volume":"241","author":"E Asarin","year":"2015","unstructured":"Asarin, E., Basset, N., Degorre, A.: Entropy of regular timed languages. Inf. Comput. 241(C), 142\u2013176 (2015)","journal-title":"Inf. Comput."},{"key":"442_CR8","doi-asserted-by":"crossref","unstructured":"Asarin, E., Basset, N., Degorre, A.: Distance on timed words and applications. In: FORMATS (2018)","DOI":"10.1007\/978-3-030-00151-3_12"},{"issue":"1","key":"442_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM 42(1), 269\u2013291 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"442_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549\u2013595 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"442_CR11","volume-title":"Reachability Problems","author":"P Bouyer","year":"2013","unstructured":"Bouyer, P., Markey, N., Sankur, O.: Robustness in timed automata. In: Abdulla, P.A., Potapov, I. (eds.) Reachability Problems. Springer, Berlin Heidelberg (2013)"},{"key":"442_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Majumdar, R.: Edit distance for timed automata. In: 17th International Conference on Hybrid Systems: Computation and Control, pp. 303\u2013312 (2014)","DOI":"10.1145\/2562059.2562141"},{"issue":"1","key":"442_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10703-008-0056-7","volume":"33","author":"M De Wulf","year":"2008","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. Formal Methods Syst. Design 33(1), 45\u201384 (2008)","journal-title":"Formal Methods Syst. Design"},{"issue":"4","key":"442_CR14","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/TPAMI.2008.197","volume":"31","author":"S Dobrisek","year":"2009","unstructured":"Dobrisek, S., Zibert, J., Pavesic, N., Mihelic, F.: An edit-distance model for the approximate matching of timed strings. IEEE Trans. Pattern Anal. Mach. Intell. 31(4), 736\u2013741 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"442_CR15","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1137\/070703776","volume":"39","author":"E Fischer","year":"2010","unstructured":"Fischer, E., Magniez, F., de Rougemont, M.: Approximate satisfiability and equivalence. SIAM J. Comput. 39(6), 2251\u20132281 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"442_CR16","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"442_CR17","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Raskin, J.-F.: Robust undecidability of timed and hybrid systems. Technical report, University of California at Berkeley, Berkeley, CA, USA, (1999)","DOI":"10.1007\/3-540-46430-1_15"},{"issue":"2","key":"442_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s00453-007-9028-3","volume":"49","author":"F Magniez","year":"2007","unstructured":"Magniez, F., de Rougemont, M.: Property testing of regular tree languages. Algorithmica 49(2), 127\u2013146 (2007)","journal-title":"Algorithmica"},{"key":"442_CR19","volume-title":"Implementation and Application of Automata","author":"M Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata. In: Champarnaud, J.-M., Maurel, D. (eds.) Implementation and Application of Automata. Springer, Berlin Heidelberg (2003)"},{"issue":"4","key":"442_CR20","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J ACM 13(4), 570\u2013581 (1966)","journal-title":"J ACM"},{"issue":"1","key":"442_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1008387132377","volume":"10","author":"A Puri","year":"2000","unstructured":"Puri, A.: Dynamical properties of timed automata. Discrete Event Dyn. Syst. 10(1), 87\u2013113 (2000)","journal-title":"Discrete Event Dyn. Syst."},{"issue":"2","key":"442_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 23\u201332 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"442_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theor. Comput. Sci. 72(1), 65\u201394 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"442_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"442_CR25","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-023-00442-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-023-00442-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-023-00442-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T09:02:31Z","timestamp":1699434151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-023-00442-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,17]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["442"],"URL":"https:\/\/doi.org\/10.1007\/s00236-023-00442-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2023,7,17]]},"assertion":[{"value":"7 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}