{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:32:36Z","timestamp":1649039556143},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1984,11]]},"DOI":"10.1016\/0020-0190(84)90079-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"173-177","source":"Crossref","is-referenced-by-count":4,"title":["Towards a formal proof system for \u03c9-rational expressions"],"prefix":"10.1016","volume":"19","author":[{"given":"Ph.","family":"Darondeau","sequence":"first","affiliation":[]},{"given":"L.","family":"Kott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90079-6_BIB1","article-title":"Comportements de processus","author":"Arnold","year":"1982","journal-title":"Colloque AFCET-SMF \u201cLes Math\u00e9matiques de l'Informatique\u201d"},{"key":"10.1016\/0020-0190(84)90079-6_BIB2","article-title":"On a decision method in restricted second order arithmetic","volume":"9","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0020-0190(84)90079-6_BIB3","series-title":"10th ICALP","article-title":"On the observational semantics of fair parallelism","volume":"154","author":"Darondeau","year":"1983"},{"key":"10.1016\/0020-0190(84)90079-6_BIB4","article-title":"A formal proof system for infinitary rational languages","volume":"128","author":"Darondeau","year":"1983","journal-title":"INRIA Report"},{"key":"10.1016\/0020-0190(84)90079-6_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0020-0190(84)90079-6_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00266047","article-title":"COSY, a specification language based on paths and processes","volume":"12","author":"Lauer","year":"1979","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(84)90079-6_BIB7","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":"Information and Control"},{"key":"10.1016\/0020-0190(84)90079-6_BIB8","series-title":"Theory of Automata","author":"Salomaa","year":"1969"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900796?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:58:38Z","timestamp":1555073918000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084900796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,11]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,11]]}},"alternative-id":["0020019084900796"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90079-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,11]]}}}