{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:50:26Z","timestamp":1759146626394,"version":"3.43.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1023\/a:1026218512171","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T17:53:28Z","timestamp":1067882008000},"page":"223-256","source":"Crossref","is-referenced-by-count":15,"title":["Hazard Algebras"],"prefix":"10.1007","volume":"23","author":[{"given":"J.","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5146976_CR1","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1109\/T-C.1974.223807","volume":"C-23","author":"M.A. Breuer","year":"1974","unstructured":"M.A. Breuer and L. Harrison, \u201cProcedures for eliminating static and dynamic hazards in test generation,\u201d IEEE Trans. on Computers, Vol. C-23, pp. 1069\u20131078, 1974.","journal-title":"IEEE Trans. on Computers"},{"issue":"3","key":"5146976_CR2","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/IRETELC.1962.5407917","volume":"EC-11","author":"J.A. Brzozowski","year":"1962","unstructured":"J.A. Brzozowski, \u201cA survey of regular expressions and their applications,\u201d IRE Trans. on Electronic Computers, Vol. EC-11, No. 3, pp. 324\u2013335, 1962.","journal-title":"IRE Trans. on Electronic Computers"},{"issue":"Suppl.","key":"5146976_CR3","first-page":"583","volume":"54","author":"J.A. Brzozowski","year":"1999","unstructured":"J.A. Brzozowski, \u201cSome applications of ternary algebras,\u201d Publicationes Mathematicae (Debrecen), Vol. 54 (Suppl.), pp. 583\u2013599, 1999.","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"5146976_CR4","first-page":"173","volume-title":"Proc. 30th Int. Symp. on Multiple-Valued Logic","author":"J.A. Brzozowski","year":"2000","unstructured":"J.A. Brzozowski, \u201cDe Morgan bisemilattices,\u201d in Proc. 30th Int. Symp. on Multiple-Valued Logic, Portland, OR, IEEE Computer Society Press, Los Alamitos, CA, May 2000, pp. 173\u2013178."},{"key":"5146976_CR5","first-page":"1","volume-title":"A Half-Century of Automata Theory","author":"J.A. Brzozowski","year":"2001","unstructured":"J.A. Brzozowski and Z. \u00c9sik, \u201cHazard algebras (Extended Abstract),\u201d in A Half-Century of Automata Theory, A. Salomaa, D. Wood, and S. Yu (Eds.), World Scientific, Singapore, 2001, pp. 1\u201319. To put a crossline over L"},{"key":"5146976_CR6","first-page":"3","volume-title":"Proc. 31st Int. Symp. on Multiple-Valued Logic","author":"J.A. Brzozowski","year":"2000","unstructured":"J.A. Brzozowski, Z. \u00c9sik, and Y. Iland, \u201cAlgebras for hazard detection,\u201d in Proc. 31st Int. Symp. on Multiple-Valued Logic, Warsaw, Poland, IEEE Computer Society Press, Los Alamitos, CA, May 2000, pp. 3\u201312. Also reprinted in M. Fitting and E. Or\u0142owska (Eds.), Beyond Two: Theory and Applications of Multiple-Valued Logic, Physica-Verlag, 2003, pp. 3\u201324."},{"key":"5146976_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-44977-9_5","volume":"2608","author":"J.A. Brzozowski","year":"2003","unstructured":"J.A. Brzozowski and M. Gheorghiu, \u201cSimulation of gate circuits in the algebra of transients,\u201d in 7th Int. Conf. on Implementation and Application of Automata, Tours, France, July 2002. Lecture Notes in Computer Science, vol. 2608, Springer 2003, pp. 57\u201366.","journal-title":"7th Int. Conf. on Implementation and Application of Automata"},{"key":"5146976_CR8","doi-asserted-by":"crossref","unstructured":"J.A. Brzozowski and C.-J.H. Seger, Asynchronous Circuits, Springer-Verlag, 1995.","DOI":"10.1007\/978-1-4612-4210-9"},{"key":"5146976_CR9","doi-asserted-by":"crossref","unstructured":"S. Burris and H.P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, 1981.","DOI":"10.1007\/978-1-4613-8130-3"},{"key":"5146976_CR10","first-page":"112","volume-title":"Proc. 3rd Int. Symp. on Advanced Research in Asynchronous Circuits and Systems","author":"S. Chakraborty","year":"1997","unstructured":"S. Chakraborty and D.L. Dill, \u201cMore accurate polynomial-time min-max simulation,\u201d in Proc. 3rd Int. Symp. on Advanced Research in Asynchronous Circuits and Systems, Eindhoven, The Netherlands, IEEE Computer Society Press, Los Alamitos, CA, April 1997, pp. 112\u2013123."},{"key":"5146976_CR11","unstructured":"B.A. Davey and H.A. Priestley, Introduction to Lattices and Order, Cambridge University Press, 1990."},{"key":"5146976_CR12","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1147\/rd.92.0090","volume":"9","author":"E.B. Eichelberger","year":"1965","unstructured":"E.B. Eichelberger, \u201cHazard detection in combinational and sequential switching circuits,\u201d IBM J. Research and Development, Vol. 9, pp. 90\u201399, 1965.","journal-title":"IBM J. Research and Development"},{"key":"5146976_CR13","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1109\/T-C.1974.223997","volume":"C-23","author":"G. Fantauzzi","year":"1974","unstructured":"G. Fantauzzi, \u201cAn algebraic model for the analysis of logic circuits,\u201d IEEE Trans. on Computers, Vol. C-23, pp. 576\u2013581, 1974.","journal-title":"IEEE Trans. on Computers"},{"key":"5146976_CR14","unstructured":"M. Gheorghiu, \u201cCircuit simulation using a hazard algebra,\u201d MMath Thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1, Dec. 2001. http:\/\/maveric.uwaterloo.ca\/publication.html."},{"key":"5146976_CR15","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-44977-9_10","volume":"2608","author":"M. Gheorghiu","year":"2003","unstructured":"M. Gheorghiu and J.A. Brzozowski, \u201cFeedback-free circuits in the algebra of transients,\u201d in 7th Int. Conf. on Implementation and Application of Automata, Tours, France, July 2002. Lecture Notes in Computer Science, vol. 2608, Springer 2003, pp. 106\u2013116.","journal-title":"7th Int. Conf. on Implementation and Application of Automata"},{"key":"5146976_CR16","unstructured":"M. Goto, \u201cApplication of three-valued logic to construct the theory of relay networks\u201d (in Japanese), in Proceedings of the Joint Meeting of IEE, IECE, and I.of Illumination E. of Japan, 1948."},{"key":"5146976_CR17","doi-asserted-by":"crossref","unstructured":"G. Gr\u00e4tzer, Universal Algebra, 2nd ed., Springer-Verlag, 1979.","DOI":"10.1007\/978-0-387-77487-9"},{"key":"5146976_CR18","doi-asserted-by":"crossref","unstructured":"J.P. Hayes, \u201cDigital simulation with multiple logic values,\u201d IEEE Trans. on Computer-Aided Design, Vol.CAD-5, No. 2, 1986.","DOI":"10.1109\/TCAD.1986.1270196"},{"key":"5146976_CR19","doi-asserted-by":"crossref","unstructured":"D.W. Lewis, \u201cHazard detection by a quinary simulation of logic devices with bounded propagation delays,\u201d MSc Thesis, Electrical Engineering, Syracuse University, Syracuse, NY, Jan. 1972.","DOI":"10.1145\/800153.804941"},{"key":"5146976_CR20","unstructured":"D.E. Muller, \u201cA theory of asynchronous circuits,\u201d Technical Report 66, Digital Computer Laboratory, University of Illinois, Urbana-Champaign, Illinois, USA, 1955."},{"key":"5146976_CR21","unstructured":"D.E. Muller and W.S. Bartky, \u201cA theory of asynchronous circuits,\u201d in Proceedings of an International Symposium on the Theory of Switching, Annals of the Computation Laboratory of Harvard University, Harvard University Press, 1959, pp. 204\u2013243."},{"key":"5146976_CR22","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"A. Salomaa, Theory of Automata, Pergamon Press, Oxford, 1969."},{"key":"5146976_CR23","unstructured":"S.H. Unger, Asynchronous Sequential Switching Circuits, Wiley-Interscience, 1969."}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026218512171.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026218512171\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026218512171.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:23:01Z","timestamp":1754425381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026218512171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["5146976"],"URL":"https:\/\/doi.org\/10.1023\/a:1026218512171","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}