{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:05:24Z","timestamp":1773615924917,"version":"3.50.1"},"reference-count":18,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"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":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.3103\/s0146411621070178","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T09:15:43Z","timestamp":1643706943000},"page":"751-762","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Modeling of Sequential Reactive Systems by Means of Real Time Automata"],"prefix":"10.3103","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7328-0942","authenticated-orcid":false,"given":"E. M.","family":"Vinarskii","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-9565","authenticated-orcid":false,"given":"V. A.","family":"Zakharov","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"7402_CR1","volume-title":"Introduction to the Theory of Finite-State Machines","author":"A. Gill","year":"1962","unstructured":"Gill, A., et al., Introduction to the Theory of Finite-State Machines, McGraw Hill, 1962."},{"key":"7402_CR2","unstructured":"Savelev, A.Y., Prikladnaya teoriya tsifrovyh avtomatov (Applied Theory of Digital Automata), Moscow: Vyssh. Shk., 1987."},{"key":"7402_CR3","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. and Dill, D., A theory of timed automata, Theor. Comput. Sci., 1994, vol. 126, no. 2, pp. 183\u2013235.","journal-title":"Theor. Comput. Sci."},{"key":"7402_CR4","first-page":"1","volume":"49","author":"E. Asarin","year":"2001","unstructured":"Asarin, E., Caspi, P., and Maler, O., Timed regular expressions, J. ACM, 2001, vol. 49, no. 2, pp. 1\u201335.","journal-title":"J. ACM"},{"key":"7402_CR5","doi-asserted-by":"crossref","unstructured":"Asarin, E., Caspi, P., and Maler, O., A Kleene theorem for timed automata, Proceedings of 12-th Annual IEEE Symposium on Logic in Computer Science (LICS\u201997), IEEE, 1997, pp. 160\u2013171.","DOI":"10.1109\/LICS.1997.614944"},{"key":"7402_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R. and Madhusudan, P., Decision problems for timed automata: A survey, formal methods for the design of real-time systems, Proceedings of the 4-th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM\u201904), Springer, 2004, pp. 1\u201324.","DOI":"10.1007\/978-3-540-30080-9_1"},{"key":"7402_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1342991.1342994","volume":"9","author":"S. Lasota","year":"2008","unstructured":"Lasota, S. and Walukiewicz, I., Alternating timed automata, ACM Trans. Comput. Logic, 2008, vol. 9, no. 2, pp.\u00a01\u201326.","journal-title":"ACM Trans. Comput. Logic"},{"key":"7402_CR8","series-title":"Distinguishing non-deterministic timed finite state machines","volume-title":"Formal Techniques for Distributed Systems","author":"M. Gromov","year":"2009","unstructured":"Gromov, M., El-Fakih, K., Shabaldina, N., and Yevtushenko, N., Distinguishing non-deterministic timed finite state machines, in Formal Techniques for Distributed Systems, Springer, 2009, pp. 137\u2013151."},{"key":"7402_CR9","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.comnet.2007.10.002","volume":"52","author":"M.G. Merayo","year":"2008","unstructured":"Merayo, M.G., Nunez, M., and Rodriguez, I., Formal testing from timed finite state machines, Comput. Networks, 2008, vol. 52, no. 2, pp. 432\u2013460.","journal-title":"Comput. Networks"},{"key":"7402_CR10","doi-asserted-by":"crossref","unstructured":"Bresolin, D., El-Fakih, K., Villa, T., and Yevtushenko, N., Deterministic timed finite state machines: Equivalence checking and expressive power, Proceedings of the 5-th International Symposium on Games, Automata, Logics and Formal Verification, 2014, pp. 203\u2013216.","DOI":"10.4204\/EPTCS.161.18"},{"key":"7402_CR11","first-page":"77","volume":"29","author":"A. Tvardovskii","year":"2014","unstructured":"Tvardovskii, A. and Yevtushenko, N., Minimizing timed finite state machines, Tomsk State Univ., \n               J. Control Comput. Sci., 2014, vol. 29, no. 4, pp. 77\u201383.","journal-title":"J. Control Comput. Sci."},{"key":"7402_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.15514\/ISPRAS-2017-29(4)-9","volume":"29","author":"A.S. Tvardovskii","year":"2017","unstructured":"Tvardovskii, A.S., Yevtushenko, N.V., and Gromov, M.L., Minimizing finite state machines with time guards and timeouts, Proc. Inst. Syst. Program. RAS, 2017, vol. 29, no. 4, pp. 139\u2013154.","journal-title":"Proc. Inst. Syst. Program. RAS"},{"key":"7402_CR13","first-page":"1","volume":"17","author":"A.S. Tvardovskii","year":"2020","unstructured":"Tvardovskii, A.S. and Yevtushenko, N.V., Deriving homing sequences for Finite State Machines with timed guards, Sist. Inf., 2020, vol. 17, pp. 1\u201310.","journal-title":"Sist. Inf."},{"key":"7402_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N. McKeown","year":"2008","unstructured":"McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., and Turner, J., OpenFlow: Enabling innovation in campus networks, ACM SIGCOMM Comput. Commun. Rev., 2008, vol. 38, no. 2, pp. 69\u201374.","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"7402_CR15","doi-asserted-by":"crossref","unstructured":"Vinarskii, E., Lopez, J., Kushik, N., Yevtushenko, N., and Zeghlache, D., A model checking based approach for detecting SDN races, Proceedings of the 31-st IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS), Springer, 2019, pp. 194\u2013211.","DOI":"10.1007\/978-3-030-31280-0_12"},{"key":"7402_CR16","doi-asserted-by":"crossref","unstructured":"Vinarskii, E.M. and Zakharov, V.A., On the verification of strictly deterministic behavior of Timed Finite State Machines, Proc. ISP RAS, 2018, vol. 30, no. 3, pp. 325\u2013340.","DOI":"10.15514\/ISPRAS-2018-30(3)-22"},{"key":"7402_CR17","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C. and Katoen, J.-P., Principles of Model Checking, Cambridge: MIT Press Cambridge, 2008."},{"key":"7402_CR18","doi-asserted-by":"crossref","unstructured":"Behrmann, G., David, A., and Larsen, K.G., A tutorial on Uppaal, Proceedings of the International School on Formal Methods for the Design of Computer, Communication, and Software Systems, Springer, 2004, pp. 200\u2013236.","DOI":"10.1007\/978-3-540-30080-9_7"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621070178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411621070178","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411621070178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:07:17Z","timestamp":1773612437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411621070178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["7402"],"URL":"https:\/\/doi.org\/10.3103\/s0146411621070178","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"16 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}