{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:51Z","timestamp":1720201131171},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90181-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"277-291","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Specification and verification of decentralized daisy chain arbiters with \u03c9-extended regular expressions"],"prefix":"10.1016","volume":"43","author":[{"given":"I.","family":"Suzuki","sequence":"first","affiliation":[]},{"given":"Y.","family":"Motohashi","sequence":"additional","affiliation":[]},{"given":"K.","family":"Taniguchi","sequence":"additional","affiliation":[]},{"given":"T.","family":"Kasami","sequence":"additional","affiliation":[]},{"given":"T.","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90181-7_bib1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TC.1982.1675978","article-title":"Hardware specification with temporal logic: An example","volume":"C-31","author":"Bochmann","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(86)90181-7_bib2","series-title":"Proc. Int. Conf. on Logic, Methodology and Philosophy of Sciences 1960","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(86)90181-7_bib3","series-title":"Tech. Rept. IFI-HH-M-109\/83","article-title":"Fairness criteria that guarantees infinite firing of transitions","author":"Carstensen","year":"1983"},{"key":"10.1016\/0304-3975(86)90181-7_bib4","series-title":"Advances in Petri Nets","first-page":"83","article-title":"Infinite behaviours and fairness in Petri nets","volume":"188","author":"Carstensen","year":"1985"},{"key":"10.1016\/0304-3975(86)90181-7_bib5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","article-title":"Theories of automata on \u03c9-tapes: A simplified approach","volume":"8","author":"Choueka","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90181-7_bib6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","article-title":"Theory of \u03c9-languages I: Characterizations of \u03c9-context-free languages","volume":"15","author":"Cohen","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90181-7_bib7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TCOM.1983.1095720","article-title":"Modular verification of computer communication protocols","volume":"COM-31","author":"Heilpern","year":"1983","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0304-3975(86)90181-7_bib8","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decision problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(86)90181-7_bib9","series-title":"The Correctness Problem in Computer Science","article-title":"Verification of concurrent programs: The temporal framework","author":"Manna","year":"1981"},{"key":"10.1016\/0304-3975(86)90181-7_bib10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90181-7_bib11","series-title":"Proc. 4th Ann. Symp. on Switching Circuit Theory and Logical Design","first-page":"3","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963"},{"key":"10.1016\/0304-3975(86)90181-7_bib12","series-title":"Theoretical Foundations of Programming Methodology","first-page":"473","article-title":"Behavior of processes and synchronized systems of processes","author":"Nivat","year":"1982"},{"key":"10.1016\/0304-3975(86)90181-7_bib13","series-title":"Proc. 5th GI-Conf. on Theoretical Computer Science","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981"},{"key":"10.1016\/0304-3975(86)90181-7_bib14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/T-C.1972.223429","article-title":"Asynchronous arbiters","volume":"C-21","author":"Plummer","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(86)90181-7_bib15","series-title":"AFIPS Conference Proceedings","first-page":"719","article-title":"A systematic approach to the design of digital bussing structures","author":"Thurber","year":"1972"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901817?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901817?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:53:03Z","timestamp":1553158383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":15,"alternative-id":["0304397586901817"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90181-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}