{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T08:47:05Z","timestamp":1766047625001},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0020-0190(99)00005-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:27:49Z","timestamp":1027585669000},"page":"137-143","source":"Crossref","is-referenced-by-count":4,"title":["Undecidability of partial order logics"],"prefix":"10.1016","volume":"69","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00005-8_BIB1","series-title":"Proc. LICS'96, 11th IEEE Symposium on Logic in Computer Science","first-page":"219","article-title":"Model-checking of correctness conditions for concurrent objects","author":"Alur","year":"1996"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB2","series-title":"ICALP'98","first-page":"41","article-title":"Deciding global partial-order properties","volume":"Vol. 1443","author":"Alur","year":"1998"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB3","series-title":"Proc. 10th Symposium on Logic in Computer Science","first-page":"90","article-title":"Model-checking of causality properties","author":"Alur","year":"1995"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB4","series-title":"Concurrency Control and Recovery in Database Systems","author":"Bernstein","year":"1987"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB5","first-page":"169","article-title":"Characterizing correctness properties of parallel programs using fixpoints, automata, languages and programming","volume":"Vol. 85","author":"Emerson","year":"1980"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB6","first-page":"21","article-title":"Interleaving set temporal logic","volume":"75","author":"Katz","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00005-8_BIB7","series-title":"Advances in Petri Nets, 1986","first-page":"279","article-title":"Trace theory","volume":"Vol. 255","author":"Mazurkiewicz","year":"1987"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(92)90007-I","article-title":"On undecidability of propositional temporal logics on trace systems","volume":"43","author":"Penczek","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(99)00005-8_BIB9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(94)90009-4","article-title":"Proving partial order properties","volume":"126","author":"Peled","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(99)00005-8_BIB10","series-title":"Proc. 3rd ACM Symposium on Principles of Distributed Computing","first-page":"28","article-title":"A temporal logic for reasoning about partially ordered computations","author":"Pinter","year":"1984"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB11","series-title":"Proc. 18th FOCS, IEEE Symposium on Foundation of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"issue":"1","key":"10.1016\/S0020-0190(99)00005-8_BIB12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","article-title":"Modeling concurrency with partial orders","volume":"15","author":"Pratt","year":"1986","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB13","series-title":"11th ICALP","first-page":"403","article-title":"Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness","volume":"Vol. 172","author":"Reisig","year":"1984"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB14","series-title":"Proc. LICS'97","first-page":"183","article-title":"An expressively complete linear time temporal logic for Mazurkiewicz traces","author":"Thiagarajan","year":"1997"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB15","series-title":"ICALP'98","first-page":"140","article-title":"Difficult configurations\u2014on the complexity of LTrL","volume":"Vol. 1443","author":"Walukiewicz","year":"1998"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB16","doi-asserted-by":"crossref","unstructured":"W. Zielonka, Notes on finite asynchronous automata, R.A.I.R.O.\u2014Informatique Theorique et Applications 21, 99\u2013135.","DOI":"10.1051\/ita\/1987210200991"},{"key":"10.1016\/S0020-0190(99)00005-8_BIB17","series-title":"Proc. Symposium on Logical Foundations of Computer Science, Logic at Botic 1989","first-page":"278","article-title":"Safe executions of recognizable trace languages by asynchronous automata","volume":"Vol. 363","author":"Zielonka","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099000058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099000058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:55:10Z","timestamp":1556628910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099000058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0020019099000058"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00005-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}