{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:49:33Z","timestamp":1676893773795},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4946,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0304-3975(99)00021-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:38:06Z","timestamp":1027604286000},"page":"113-128","source":"Crossref","is-referenced-by-count":2,"title":["Automata of asynchronous behaviors"],"prefix":"10.1016","volume":"231","author":[{"given":"J.A.","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Negulescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00021-3_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01660033","article-title":"On the existence of delay-insensitive fair arbiters: trace theory and its limitations","volume":"1","author":"Black","year":"1986","journal-title":"Distributed Computing"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB2","doi-asserted-by":"crossref","unstructured":"K.S. Brace, R.L. Rudell, R.E. Bryant, Efficient implementation of a BDD package, Proc. 27th ACM\/IEEE Design Automation Conf., 1990, pp. 40\u201345.","DOI":"10.1145\/123186.123222"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB3","doi-asserted-by":"crossref","unstructured":"R.E. Bryant, Graph based algorithms for Boolean function manipulation, IEEE Trans. Comput. C-35 (1986) 677\u2013691.","DOI":"10.1109\/TC.1986.1676819"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB4","series-title":"Asynchronous Circuits","author":"Brzozowski","year":"1995"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB5","unstructured":"J.A. Brzozowski, H. Zhang, Delay-insensitivity and semi-modularity, in: Formal Methods in System Design, to appear. Also Research Report CS-97-11, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1997."},{"key":"10.1016\/S0304-3975(99)00021-3_BIB6","unstructured":"S. Eilenberg, Automata, Languages, and Machines, vol. A, Academic Press, New York, 1974."},{"key":"10.1016\/S0304-3975(99)00021-3_BIB7","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB8","doi-asserted-by":"crossref","unstructured":"C.E. Molnar, I.W. Jones, B. Coates, J. Lexau, A FIFO ring oscillator performance experiment, Proc. Internat. Symp. on Advanced Research in Asynchronous Circuits and Systems, 1997.","DOI":"10.1109\/ASYNC.1997.587181"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB9","first-page":"129","article-title":"Gedanken experiments on sequential machines","volume":"34","author":"Moore","year":"1956","journal-title":"Automata studies, Ann. Math. Studies"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB10","unstructured":"R. Negulescu, Process spaces, Research Report CS-95-48, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1995."},{"key":"10.1016\/S0304-3975(99)00021-3_BIB11","unstructured":"R. Negulescu, A technique for finding and verifying speed-dependences in gate circuits, Proc. ACM\/IEEE Internat. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 1997."},{"key":"10.1016\/S0304-3975(99)00021-3_BIB12","doi-asserted-by":"crossref","unstructured":"R. Negulescu, Event-driven verification of switch-level correctness concerns, Proc. Internat. Conf. on Application of Concurrency to System Design, 1998.","DOI":"10.1109\/CSD.1998.657553"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB13","unstructured":"R. Negulescu, Process spaces and formal verification of asynchronous circuits, Ph.D. Thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada, 1998. http:\/\/www.macs.ece.mcgill.ca\/~radu\/ps.html"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1008602014766","article-title":"Relative liveness: from intuition to automated verification","volume":"12","author":"Negulescu","year":"1998","journal-title":"Formal Methods System Des."},{"key":"10.1016\/S0304-3975(99)00021-3_BIB15","doi-asserted-by":"crossref","unstructured":"R. Negulescu, A. Peeters, Verification of speed-dependences in single-rail handshake circuits, Proc. Internat. Symp. on Advanced Research in Asynchronous Circuits and Systems, 1998.","DOI":"10.1109\/ASYNC.1998.666502"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB16","unstructured":"J.T. Udding, Classification and composition of delay-insensitive circuits, Ph.D. Thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands, 1984."},{"key":"10.1016\/S0304-3975(99)00021-3_BIB17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01660032","article-title":"A formal model for defining and classifying delay-insensitive circuits and systems","volume":"1","author":"Udding","year":"1986","journal-title":"Distributed Computing"},{"key":"10.1016\/S0304-3975(99)00021-3_BIB18","series-title":"Delay-insensitive networks, MMath. Thesis","author":"Zhang","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:28:09Z","timestamp":1556522889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0304397599000213"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00021-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}