{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:33Z","timestamp":1726452093064},"reference-count":5,"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)90034-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"285-303","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["An algebraic and algorithmic method for analysing transition systems"],"prefix":"10.1016","volume":"46","author":[{"given":"Anne","family":"Dicky","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90034-4_BIB1","series-title":"Colloque AFCET \u201cLes Math\u00e9matiques de l'Informatique\u201d","first-page":"35","article-title":"Comportements de processus","author":"Arnold","year":"1982"},{"key":"10.1016\/0304-3975(86)90034-4_BIB2","series-title":"10th Ann. Symp. on Principles of Programming Languages","article-title":"Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach","author":"Clarke","year":"1983"},{"key":"10.1016\/0304-3975(86)90034-4_BIB3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90034-4_BIB4","series-title":"22nd Symp. on Foundations of Computer Science","article-title":"A decidable \u03bc-calculus, Preliminary Rept.","author":"Pratt","year":"1981"},{"key":"10.1016\/0304-3975(86)90034-4_BIB5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","article-title":"Fairness and related properties in transition systems: A temporal logic to deal with fairness","volume":"19","author":"Queille","year":"1983","journal-title":"Acta Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:53:41Z","timestamp":1553187221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":5,"alternative-id":["0304397586900344"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90034-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1986]]}}}