{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:05:35Z","timestamp":1649181935471},"reference-count":19,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":9024,"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":[[1988,11]]},"DOI":"10.1016\/0304-3975(88)90126-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"259-277","source":"Crossref","is-referenced-by-count":8,"title":["Determinism and looping in combinatory PDL"],"prefix":"10.1016","volume":"61","author":[{"given":"George","family":"Gargov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solomon","family":"Passy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90126-0_BIB1","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","article-title":"Deterministic propositional dynamic logic: finite models, complexity, and completeness","volume":"25","author":"Ben-Ari","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90126-0_BIB2","doi-asserted-by":"crossref","first-page":"194","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\/0304-3975(88)90126-0_BIB3","series-title":"Mathematical Theory of Programming","first-page":"42","article-title":"Decidability of the basic combinatory propositional dynamic logic","author":"Gargov","year":"1985"},{"key":"10.1016\/0304-3975(88)90126-0_BIB4","series-title":"Ph.D. Thesis","article-title":"Logics of programs: axiomatics and descriptive power","author":"Harel","year":"1978"},{"key":"10.1016\/0304-3975(88)90126-0_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(85)90069-9","article-title":"More on looping vs. repeating in dynamic logic","volume":"20","author":"Harel","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90126-0_BIB6","first-page":"203","article-title":"Non-determinism in logics of programs","author":"Harel","year":"1978","journal-title":"Proc. 5th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(88)90126-0_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0019-9958(82)90553-8","article-title":"Looping vs. repeating in dynamic logic","volume":"55","author":"Harel","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90126-0_BIB8","series-title":"Proc. Internat. Coll. on Formalization of Programming Concepts","first-page":"356","article-title":"Proof-theoretic methodology for propositional dynamic logic","volume":"107","author":"Leivant","year":"1981"},{"key":"10.1016\/0304-3975(88)90126-0_BIB9","series-title":"Foundations of Computation Theory","first-page":"347","article-title":"Propositional logics of programs: new directions","volume":"158","author":"Parikh","year":"1983"},{"key":"10.1016\/0304-3975(88)90126-0_BIB10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(85)90127-9","article-title":"PDL with data constants","volume":"20","author":"Passy","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90126-0_BIB11","unstructured":"S. Passy and T. Tinchev, Combinatory dynamic logic, Inform. and Control, to appear."},{"key":"10.1016\/0304-3975(88)90126-0_BIB12","series-title":"Proc. Fundamentals of Computation Theory","first-page":"512","article-title":"Quantifiers in combinatory PDL: completeness, definability, incompleteness","volume":"199","author":"Passy","year":"1985"},{"key":"10.1016\/0304-3975(88)90126-0_BIB13","series-title":"Tech. Rept. CS84-14","article-title":"Concurrent dynamic logic","author":"Peleg","year":"1984"},{"key":"10.1016\/0304-3975(88)90126-0_BIB14","article-title":"Application of modal logic to programming","author":"Pratt","year":"1978","journal-title":"Tech. Rept. MIT\/LCS\/TM-116"},{"key":"10.1016\/0304-3975(88)90126-0_BIB15","article-title":"Dynamic algebras: examples, constructions, applications","author":"Pratt","year":"1979","journal-title":"Tech. Rept. MIT\/LCS\/TM-138"},{"key":"10.1016\/0304-3975(88)90126-0_BIB16","series-title":"The Mathematics of Metamathematics","author":"Rasiowa","year":"1963"},{"key":"10.1016\/0304-3975(88)90126-0_BIB17","series-title":"Universal Algebra and Applications","first-page":"268","article-title":"A completeness theorem in the modal logic of programs","volume":"9","author":"Segerberg","year":"1982"},{"key":"10.1016\/0304-3975(88)90126-0_BIB18","series-title":"Ph.D. Thesis","article-title":"Propositional dynamic logic of looping and converse","author":"Streett","year":"1982"},{"key":"10.1016\/0304-3975(88)90126-0_BIB19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","article-title":"Propositional dynamic logic of looping and converse is elementarily decidable","volume":"54","author":"Streett","year":"1982","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901260?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901260?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:42Z","timestamp":1555127682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0304397588901260"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90126-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}