{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T11:14:39Z","timestamp":1769598879041,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,16]],"date-time":"1999-02-16T00:00:00Z","timestamp":919123200000},"content-version":"vor","delay-in-days":960,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00095-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"109-122","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["The complexity of PDL with interleaving"],"prefix":"10.1016","volume":"161","author":[{"given":"Alain J.","family":"Mayer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry J.","family":"Stockmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00095-X_BIB1","series-title":"Report 80-08-01","article-title":"Decidability and expressiveness of logics of processes","author":"Abrahamson","year":"1980"},{"key":"10.1016\/0304-3975(95)00095-X_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00095-X_BIB3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","article-title":"Complexity measures for regular expressions","volume":"12","author":"Ehrenfeucht","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00095-X_BIB4","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(95)00095-X_BIB5","series-title":"Proc. 7th ICALP","first-page":"234","article-title":"The complexity of the inequivalence problem for regular expressions with intersection","volume":"Vol. 85","author":"F\u00fcrer","year":"1980"},{"key":"10.1016\/0304-3975(95)00095-X_BIB6","article-title":"How hard is it to reason about prepositional programs?","author":"Harel","year":"1992"},{"key":"10.1016\/0304-3975(95)00095-X_BIB7_1","series-title":"Proc. 5th IEEE Symp. on Logic in Computer Science","first-page":"479","article-title":"On the power of bounded concurrency III: reasoning about programs","author":"Harel","year":"1990"},{"key":"10.1016\/0304-3975(95)00095-X_BIB7_2","author":"Harel","year":"1990"},{"key":"10.1016\/0304-3975(95)00095-X_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0019-9958(85)80047-4","article-title":"Propositional dynamic logic of flowcharts","volume":"64","author":"Harel","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00095-X_BIB9","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00095-X_BIB10","article-title":"The equivalence problem for regular expressions with intersection is not polynomial in tape","author":"Hunt","year":"1973"},{"key":"10.1016\/0304-3975(95)00095-X_BIB11","series-title":"Proc. 20th ICALP","first-page":"519","article-title":"Deciding true concurrency equivalences on finite safe nets","volume":"Vol. 700","author":"Jategaonkar","year":"1993"},{"key":"10.1016\/0304-3975(95)00095-X_BIB12","first-page":"789","article-title":"Logics of programs","author":"Kozen","year":"1990"},{"key":"10.1016\/0304-3975(95)00095-X_BIB13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1006\/inco.1994.1098","article-title":"The complexity of word problems \u2014 this time with interleaving","volume":"115","author":"Mayer","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00095-X_BIB14","series-title":"Proc. 12th IEEE Symp. on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/0304-3975(95)00095-X_BIB15","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/23005.23008","article-title":"Concurrent dynamic logic","volume":"34","author":"Peleg","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00095-X_BIB16","series-title":"Proc. 17th IEEE Symp. on Foundations of Computer Science","first-page":"109","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/0304-3975(95)00095-X_BIB17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0022-0000(80)90061-6","article-title":"A near-optimal method for reasoning about action","volume":"20","author":"Pratt","year":"1980","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/0304-3975(95)00095-X_BIB18","series-title":"Proc. Workshop on Logics of Programs","first-page":"387","article-title":"Using graphs to understand PDL","volume":"Vol. 131","author":"Pratt","year":"1981"},{"key":"10.1016\/0304-3975(95)00095-X_BIB19","series-title":"Proc. 19th ICALP","first-page":"696","article-title":"Checking equivalences between concurrent systems of finite agents","volume":"Vol. 623","author":"Rabinovich","year":"1992"},{"key":"10.1016\/0304-3975(95)00095-X_BIB20","series-title":"Tech. Report TR-133","article-title":"The complexity of decision problems in automata theory and logic","author":"Stockmeyer","year":"1974"},{"key":"10.1016\/0304-3975(95)00095-X_BIB21","series-title":"Proc. 5th ACM Symp. on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/0304-3975(95)00095-X_BIB22","series-title":"Computational Complexity","author":"Wagner","year":"1986"},{"key":"10.1016\/0304-3975(95)00095-X_BIB23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0022-0000(84)90018-7","article-title":"On the complexity of iterated shuffle","volume":"28","author":"Warmuth","year":"1984","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500095X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500095X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:42Z","timestamp":1757477862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500095X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["030439759500095X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00095-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The complexity of PDL with interleaving","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(95)00095-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}