01024nas a2200145   4500000000100000000000100001008004100002260002700043100002000070700002500090700002500115700001900140245007400159520064500233       2025                            d  bElsevieraOsaka, Japan1 aPiotr Czekalski1 aMirosław Borowiecki1 aBolesław Pochopie´1 aGodlove Kuaban00aAn Analysis and Implementation of the Switching Sequence Table Method3 a<p><br />
This paper details the algorithm implementation of the Switching Sequence Table method in asynchronous sequential circuit Boolean switching system design. The algorithm is theoretically analysed in terms of its computational complexity and validated through actual experiments. It discusses the multidimensional problem of various parameters and their impact on performance. It then presents analytical evidence that reducing this multidimensional problem to a standard, one-dimensional problem is feasible. The authors consider method challenges when implementing computing modules for the Switching Sequence Table method.</p>