{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T03:57:02Z","timestamp":1730260622306,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:00:00Z","timestamp":1632268800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,22]]},"DOI":"10.1109\/idaacs53288.2021.9660925","type":"proceedings-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T15:43:03Z","timestamp":1641397383000},"page":"1163-1169","source":"Crossref","is-referenced-by-count":3,"title":["The Fault Tolerant \u010cern\u00fd Finite State Machine: a Concept and VHDL Models"],"prefix":"10.1109","author":[{"given":"Vyacheslav","family":"Kharchenko","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Tyurin","sequence":"additional","affiliation":[]},{"given":"Herman","family":"Fesenko","sequence":"additional","affiliation":[]},{"given":"Oleg","family":"Goncharovskij","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Cerny-Starke conjecture from the sixties of XX century","year":"2021","author":"trahtman","key":"ref10"},{"journal-title":"The Visualization of the Road Coloring Algorithm in the package TESTAS","year":"2010","author":"trahtman","key":"ref11"},{"journal-title":"Modifying the upper bound on the length of minimal synchronizing word","year":"2014","author":"trahtman","key":"ref12"},{"journal-title":"The Implementation of the Algorithm of Road Coloring","year":"2020","author":"trahtman","key":"ref13"},{"key":"ref14","first-page":"471","article-title":"Checkability Important for Fail-Safety of FPGA-based Components in Critical Systems","author":"drozd","year":"0","journal-title":"Proc Int Conf Technolog Syst Inform Security IntelITSIS 2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCSET49122.2020.235591"},{"journal-title":"National Instruments","year":"2021","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.32620\/reks.2020.3.05"},{"journal-title":"Stuck-open and Stuck-on Faults","year":"2021","key":"ref18"},{"journal-title":"Triple Module Redundancy Design Techniques for Virtex FPGAs","year":"2021","author":"carmichael","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0219033"},{"key":"ref3","first-page":"289","article-title":"On directable automata","volume":"7","author":"cern\u00fd","year":"1971","journal-title":"Kybernetica"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62809-7_8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36377-7_3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3103\/S1066369X10010020"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88282-4_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02762860"},{"key":"ref1","first-page":"52","article-title":"Around the Road Coloring Theorem","volume":"26","author":"gusev","year":"2017","journal-title":"TUCS Lecture Notes"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-009-0062-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.32620\/reks.2021.1.11"},{"key":"ref22","first-page":"25","article-title":"Colored Petri net models for clustered and tree based data aggregation in wireless sensor networks","volume":"10","author":"ahmed","year":"2018","journal-title":"Int J on Inf Tech and Security"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1134\/S000511791306009X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.47839\/ijc.19.4.1999"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1063\/5.0041760"}],"event":{"name":"2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)","start":{"date-parts":[[2021,9,22]]},"location":"Cracow, Poland","end":{"date-parts":[[2021,9,25]]}},"container-title":["2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9660827\/9660386\/09660925.pdf?arnumber=9660925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:56:47Z","timestamp":1652187407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9660925\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,22]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/idaacs53288.2021.9660925","relation":{},"subject":[],"published":{"date-parts":[[2021,9,22]]}}}