{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:37:44Z","timestamp":1770982664792,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11370,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1016\/s0019-9958(82)91022-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"165-198","source":"Crossref","is-referenced-by-count":90,"title":["Reasoning with time and chance"],"prefix":"10.1016","volume":"53","author":[{"given":"Daniel","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saharon","family":"Shelah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(82)91022-1_bib1","series-title":"Conf. Record, 8th Annual ACM Symposium on Principles of Programming Languages","first-page":"164","article-title":"The temporal logic of branching time","author":"Ben-Ari","year":"1981"},{"key":"10.1016\/S0019-9958(82)91022-1_bib2","series-title":"Proceedings, Workshop on Logics of Programs","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"131","author":"Clarke","year":"1982"},{"key":"10.1016\/S0019-9958(82)91022-1_bib3","series-title":"Modal Logic: An Introduction","author":"Chellas","year":"1980"},{"key":"10.1016\/S0019-9958(82)91022-1_bib4","series-title":"Proceedings, 10th International Colloquium on Automata, Languages and Programming","article-title":"Symmetric and economical solutions to the mutual exclusion problem in a distributed system","author":"Cohen","year":"1983"},{"key":"10.1016\/S0019-9958(82)91022-1_bib5","series-title":"Conf. Record, 14th Annual ACM Symposium on Theory of Computing","first-page":"169","article-title":"Decision procedures and expressiveness in the temporal logic of branching time","author":"Emerson","year":"1982"},{"key":"10.1016\/S0019-9958(82)91022-1_bib6","series-title":"Conf. Record, 14th Annual ACM Symposium on Theory of Computing","first-page":"181","article-title":"A probabilistic dynamic logic","author":"Feldman","year":"1982"},{"key":"10.1016\/S0019-9958(82)91022-1_bib7","series-title":"Conf. Record, 7th Annual ACM Symposium on Principles of Programming Languages","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980"},{"key":"10.1016\/S0019-9958(82)91022-1_bib8","series-title":"An Introduction to Modal Logic","author":"Hughes","year":"1972"},{"key":"10.1016\/S0019-9958(82)91022-1_bib9","series-title":"Proceedings, 15th Annual ACM Symposium on Theory of Computing","article-title":"A logic to reason about likelihood","author":"Halpern","year":"1983"},{"key":"10.1016\/S0019-9958(82)91022-1_bib10","series-title":"Conf. Record, 9th Annual ACM Symposium on Principles of Programming Languages","first-page":"1","article-title":"Termination of probabilistic concurrent programs","author":"Hart","year":"1982"},{"key":"10.1016\/S0019-9958(82)91022-1_bib11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","article-title":"Semantics of probabilistic programs","volume":"22","author":"Kozen","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(82)91022-1_bib12","series-title":"Denumerable Markov Chains","author":"Kemeny","year":"1966"},{"key":"10.1016\/S0019-9958(82)91022-1_bib13","series-title":"Conf. Record, 7th Annual ACM Symposium on Principles of Programming Languages","first-page":"174","article-title":"\u201cSometimes\u201d is sometimes \u201cnot never\u201d","author":"Lamport","year":"1980"},{"key":"10.1016\/S0019-9958(82)91022-1_bib14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1137\/0211029","article-title":"On primality tests","volume":"11","author":"Lehmann","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(82)91022-1_bib15","series-title":"Proceedings, 8th International Colloquium on Automata, Languages, and Programming","first-page":"264","article-title":"Impartiality, Justice, and Fairness: The ethics of concurrent termination","author":"Lehmann","year":"1981"},{"key":"10.1016\/S0019-9958(82)91022-1_bib16","series-title":"Conf. Record, Annual ACM Symposium on Principles of Programming Languages","first-page":"133","article-title":"On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem","author":"Lehmann","year":"1981"},{"key":"10.1016\/S0019-9958(82)91022-1_bib17","series-title":"A probabilistic propositional dynamic logic","author":"Makowski","year":"1982"},{"key":"10.1016\/S0019-9958(82)91022-1_bib18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","article-title":"The temporal semantics of concurrent programs","volume":"13","author":"Pnueli","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(82)91022-1_bib19","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0019-9958(82)91022-1_bib20","series-title":"Algorithms and Complexity, New Directions and Recent Results","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/S0019-9958(82)91022-1_bib21","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","article-title":"N-process mutual exclusion with bounded waiting by 4 log N-valued shared variable","volume":"25","author":"Rabin","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(82)91022-1_bib22","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00288965","article-title":"The choice coordination problem","volume":"17","author":"Rabin","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/S0019-9958(82)91022-1_bib23","series-title":"Proceedings, 12th ACM Symposium on Theory of Computing","first-page":"8","article-title":"Logics for probabilistic programming","author":"Reif","year":"1980"},{"key":"10.1016\/S0019-9958(82)91022-1_bib24","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"159","article-title":"The complexity of propositional linear temporal logics","author":"Sisla","year":"1982"},{"key":"10.1016\/S0019-9958(82)91022-1_bib25_1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(82)91022-1_bib25_2","first-page":"118","volume":"7","author":"Solovay","year":"1978","journal-title":"Erratum"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882910221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995882910221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:30:06Z","timestamp":1548941406000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995882910221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["S0019995882910221"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(82)91022-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}