{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:15Z","timestamp":1762458375469},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,4,1]],"date-time":"1984-04-01T00:00:00Z","timestamp":449625600000},"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":10699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,4]]},"DOI":"10.1016\/0022-0000(84)90065-5","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"193-215","source":"Crossref","is-referenced-by-count":27,"title":["A probabilistic dynamic logic"],"prefix":"10.1016","volume":"28","author":[{"given":"Yishai A.","family":"Feldman","sequence":"first","affiliation":[]},{"given":"David","family":"Harel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90065-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207005","article-title":"Soundness and completeness of an axiom system for program verification","volume":"7","author":"Cook","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(84)90065-5_BIB2","series-title":"15th ACM Symposium on Theory of Computing","article-title":"A decidable propositional probabilistic dynamic logic","author":"Feldman","year":"1983"},{"key":"10.1016\/0022-0000(84)90065-5_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90065-5_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF02759729","article-title":"Concerning measures in first order calculi","author":"Gaifman","year":"1964","journal-title":"Israel J. Math."},{"key":"10.1016\/0022-0000(84)90065-5_BIB5","series-title":"Measure Theory","author":"Halmos","year":"1950"},{"key":"10.1016\/0022-0000(84)90065-5_BIB6","author":"Harel","year":"1979"},{"key":"10.1016\/0022-0000(84)90065-5_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0003-4843(78)90022-0","article-title":"Probability logic","volume":"14","author":"Hoover","year":"1978","journal-title":"Ann. of Math. Logic"},{"key":"10.1016\/0022-0000(84)90065-5_BIB8","series-title":"9th ACM Symposium on Principles of Programming Languages","article-title":"Termination of probabilistic concurrent programs","author":"Hart","year":"1982"},{"key":"10.1016\/0022-0000(84)90065-5_BIB9_1","series-title":"20th IEEE Symposium on Foundations of Computer Science","first-page":"101","article-title":"Semantics of probabilistic programs","author":"Kozen","year":"1979"},{"key":"10.1016\/0022-0000(84)90065-5_BIB9_2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"Kozen","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90065-5_BIB10","series-title":"15th ACM Symposium on Theory of Computing","article-title":"A probabilistic PDL","author":"Kozen","year":"1983"},{"key":"10.1016\/0022-0000(84)90065-5_BIB11","series-title":"8th 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":"Lehman","year":"1981"},{"key":"10.1016\/0022-0000(84)90065-5_BIB12","article-title":"Descriptive set theory","author":"Martin","year":"1977"},{"key":"10.1016\/0022-0000(84)90065-5_BIB13","series-title":"Descriptive Set Theory","author":"Moschovakis","year":"1980"},{"key":"10.1016\/0022-0000(84)90065-5_BIB14","series-title":"18th IEEE Symposium on Foundations of Computer Science","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0022-0000(84)90065-5_BIB15","series-title":"17th IEEE Symposium on Foundations of Computer Science","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/0022-0000(84)90065-5_BIB16","series-title":"Algorithms and Complexity","article-title":"Probabilistic algorithms","author":"Rabn","year":"1976"},{"key":"10.1016\/0022-0000(84)90065-5_BIB17","article-title":"Probabilistic Algorithms in Finite Fields","author":"Rabin","year":"1979","journal-title":"Technical Report MIT\/LCS\/TR-213"},{"key":"10.1016\/0022-0000(84)90065-5_BIB18","article-title":"Formalizing the Analysis of Algorithms","author":"Ramshaw","year":"1981"},{"key":"10.1016\/0022-0000(84)90065-5_BIB19","series-title":"12th ACM Symposium on Theory of Computing","article-title":"Logics for probabilistic programming","author":"Reif","year":"1980"},{"key":"10.1016\/0022-0000(84)90065-5_BIB20","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(84)90065-5_BIB21","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0022-0000(84)90065-5_BIB22","series-title":"Aspects of Inductive Logic","article-title":"Assigning probabilities to logical formulas","author":"Scott","year":"1966"},{"key":"10.1016\/0022-0000(84)90065-5_BIB23","series-title":"The probabilistic verification of programs. I. Correctness analysis of sequential programs","author":"Sharir","year":"1981"},{"key":"10.1016\/0022-0000(84)90065-5_BIB24","series-title":"Propositional probabilistic dynamic logic; vague functions and probabilistic and fair looping","author":"Tiomkin","year":"1981"},{"key":"10.1016\/0022-0000(84)90065-5_BIB25","series-title":"18th IEEE Symposium on Foundations of Computer Science","article-title":"Probabilistic computations: Toward a unified measure of complexity","author":"Yao","year":"1977"},{"key":"10.1016\/0022-0000(84)90065-5_BIB26","series-title":"Proceedings, IFIP Congress","article-title":"Fuzzy logic and its applications to approximate reasoning","author":"Zadeh","year":"1974"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:53:53Z","timestamp":1550332433000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,4]]}},"alternative-id":["0022000084900655"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90065-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,4]]}}}