{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T13:40:17Z","timestamp":1736257217928,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540123170"},{"type":"electronic","value":"9783540400387"}],"license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/bfb0036928","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:38:14Z","timestamp":1138210694000},"page":"445-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning with time and chance"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,12,26]]},"reference":[{"key":"36_CR1","unstructured":"Ben-Ari, M., Manna, Z. and Pnueli, A. The temporal logic of branching time, Conf. Record 8th Annual ACM Symposium on Principles of Programming Languages, Williamsburg, Va. (Jan. 1981), pp. 164\u2013176."},{"key":"36_CR2","unstructured":"Clarke, E.M. and Emerson, E.A. Design and synthesis of synchronization skeletons using branching time temporal logic, Proc. Workshop on Logics of Programs, Kozen ed., Springer-Verlag (1982) (to appear)."},{"key":"36_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal logic, an introduction","author":"B. F. Chellas","year":"1980","unstructured":"Chellas, B. F. Modal logic, an introduction, Cambridge University Press, Cambridge (1980)."},{"key":"36_CR4","unstructured":"Cohen, S., Lehmann D. and Pnueli, A. Symmetric and economical solutions to the mutual exclusion problem in a distributed system (in preparation)."},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Emerson, E. A. and Halpern, J. Y. Decision procedures and expressiveness in the temporal logic of branching time, Conf. Record 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA (May 1982), pp. 169\u2013179.","DOI":"10.1145\/800070.802190"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, Y. A. and Harel, D. A probabilistic dynamic logic, Conf. Record 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA (May 1982), pp. 181\u2013195. (also Tech. Report CS82-07, Dept. of Applied Mathematics, the Weizmann Institute of Science).","DOI":"10.1145\/800070.802191"},{"key":"36_CR7","unstructured":"Gabbay, D., Pnueli, A., Shelah, S, and Stavi, J. On the temporal analysis of fairness, Conf. Record of 7th Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada (Jan. 1980), pp. 163\u2013173."},{"key":"36_CR8","volume-title":"An introduction to modal logic","author":"G. E. Hughes","year":"1972","unstructured":"Hughes, G. E. and Cresswell, M. J., An introduction to modal logic, Methuen, London (1972)."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Halpern, J. Y. and Rabin, M. O., A logic to reason about likelihood, Proc. 15th Annual ACM Symposium on Theory of Computing (April 1983).","DOI":"10.1145\/800061.808760"},{"key":"36_CR10","unstructured":"Hart, S., Sharir, M. and Pnueli, A. Termination of probabilistic concurrent programs, Conf. Record 9th Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico (1982), pp. 1\u20136."},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D. Kozen","year":"1981","unstructured":"Kozen, D. Semantics of probabilistic programs, J. of Computer and System Sciences Vol. 22 (1981), pp. 328\u2013350.","journal-title":"J. of Computer and System Sciences"},{"key":"36_CR12","volume-title":"Denumerable Markov chains","author":"J.G. Kemeny","year":"1966","unstructured":"Kemeny, J.G., Snell, J.L. and Knapp, A.W., Denumerable Markov chains, Van Nostrand, Princeton, NJ (1966)."},{"key":"36_CR13","unstructured":"Lamport, L. \u201cSometimes\u201d is sometimes \u201cnot never\u201d, Conf. Record of 7th Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada (Jan. 1980), pp. 174\u2013183."},{"key":"36_CR14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1137\/0211029","volume":"11","author":"D. Lehmann","year":"1982","unstructured":"Lehmann, D. On primality tests, SIAM Journal on Computing Vol. 11 (1982), pp. 374\u2013375.","journal-title":"SIAM Journal on Computing"},{"key":"36_CR15","first-page":"264","volume-title":"Impartiality, Justice and Fairness: the ethics of concurrent termination","author":"D. Lehmann","year":"1981","unstructured":"Lehmann, D., Pnueli, A. and Stavi, J. Impartiality, Justice and Fairness: the ethics of concurrent termination, Proceedings of 8th International Colloquium on Automata, Languages and Programming, July 1981, Acco, Israel, pp. 264\u2013277."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Lehmann, D. and Rabin, M. O. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem (extended abstract), Conf. Record of 8th Annual ACM Symposium on Principles of Programming Languages, Williamsburg, Va. (Jan. 198), pp. 133\u2013138.","DOI":"10.1145\/567532.567547"},{"key":"36_CR17","unstructured":"Makowski, J.A. and Tiomkin, M. A probabilistic propositional dynamic logic (Extended Abstract), manuscript 1982."},{"key":"36_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"Pnueli, A. The temporal semantics of concurrent programs, Theoretical Computer Science Vol. 13 (1981), pp. 45\u201360.","journal-title":"Theoretical Computer Science"},{"key":"36_CR19","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Rabin, M. O. Decidability of second order theories and automata on infinite trees, Trans. AMS Vol. 141 (1969), pp. 1\u201335.","journal-title":"Trans. AMS"},{"key":"36_CR20","volume-title":"Algorithms and Complexity, New Directions and Recent Results","author":"M.O. Rabin","year":"1976","unstructured":"Rabin, M.O. Probabilistic algorithms, in Algorithms and Complexity, New Directions and Recent Results, J.F. Traub, ed., Academic Press, New York, 1976."},{"key":"36_CR21","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","volume":"25","author":"M.O. Rabin","year":"1982","unstructured":"Rabin, M.O. N-process mutual exclusion with bounded waiting by 4.log N-valued shared variable, Journal of Computer and System Sciences Vol. 25 (1982) pp. 66\u201375.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR22","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00288965","volume":"17","author":"M.O. Rabin","year":"1982","unstructured":"Rabin, M.O. The choice coordination problem, Acta Informatica Vol. 17 (1982), pp. 121\u2013134.","journal-title":"Acta Informatica"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Reif, J. H. Logics for probabilistic programming, Proc. 12th ACM Symposium on Theory of Computing, Los Angeles, CA (April 1980), pp. 8\u201313.","DOI":"10.1145\/800141.804647"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Sisla, A. P. and Clarke, E. M. The complexity of propositional linear temporal logics, Proc. 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA (May 1982), pp. 159\u2013168.","DOI":"10.1145\/800070.802189"},{"key":"36_CR25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R. and Strassen V., A fast Monte-Carlo test for primality, SIAM Journal on Computing Vol. 6 (1977), pp. 84\u201385; erratum Vol. 7 (1978), pp. 118.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T12:35:39Z","timestamp":1736253339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036928"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540123170","9783540400387"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0036928","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]},"assertion":[{"value":"26 December 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}