{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:54:07Z","timestamp":1648655647000},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p> An efficient simulation algorithm using an algebra of transients for gate circuits was proposed by Brzozowski and \u00c9sik. This algorithm seems capable of predicting all the signal changes that can occur in a circuit under worst-case delay conditions. We verify this claim by comparing simulation with binary analysis. For any feedback-free circuit consisting of one- and two-input gates, we prove that all signal changes predicted by simulation occur in binary analysis, provided that wire delays are taken into account. Two types of finite automata play an important role in our proof. <\/jats:p>","DOI":"10.1142\/s0129054103002163","type":"journal-article","created":{"date-parts":[[2003,12,19]],"date-time":"2003-12-19T05:51:21Z","timestamp":1071813081000},"page":"1033-1054","source":"Crossref","is-referenced-by-count":4,"title":["SIMULATION OF FEEDBACK-FREE CIRCUITS IN THE ALGEBRA OF TRANSIENTS"],"prefix":"10.1142","volume":"14","author":[{"given":"MIHAELA","family":"GHEORGHIU","sequence":"first","affiliation":[{"name":"School of Computer Science,  University of Waterloo, Waterloo, Ontario, Canada N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JANUSZ","family":"BRZOZOWSKI","sequence":"additional","affiliation":[{"name":"School of Computer Science,  University of Waterloo, Waterloo, Ontario, Canada N2L 3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","author":"Brzozowski J. A.","journal-title":"Formal Methods in System Design"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4210-9"},{"key":"rf4","volume-title":"Automata, languages and machines","author":"Eilenberg S.","year":"1974"},{"key":"rf7","volume-title":"Formal languages","author":"Salomaa A.","year":"1973"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103002163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:25:49Z","timestamp":1565191549000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103002163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":4,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0129054103002163"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103002163","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}