{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:34Z","timestamp":1787340574645,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>Regular terms with the Kleene operations $ \\cup $, ; and $ * $ can be thought of as operators on languages, generating other languages. An equation $\\tau _1 = \\tau _2 $ between two such terms is said to be satisfiable just in case languages exist which make this equation true. We show that the satisfiability problem even for $ * $-free regular terms is undecidable. Similar techniques are used to show that a very natural extension of the Process Logic of Harel, Kozen and Parikh is undecidable.<\/jats:p>","DOI":"10.1137\/0214066","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"935-942","source":"Crossref","is-referenced-by-count":10,"title":["Equations between Regular Terms and an Application to Process Logic"],"prefix":"10.1137","volume":"14","author":[{"given":"Rohit","family":"Parikh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashok","family":"Chandra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe","family":"Halpern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albert","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RGPSS","doi-asserted-by":"crossref","unstructured":"G. Gabbay, A. Pnueli, S. Shelah, J. Stavi,  The temporal analysis of fairness,  7th Annual ACM Symposium on Principles of Programming Languages,  1980,  163\u2013173, Jan.","DOI":"10.1145\/567446.567462"},{"key":"RH1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80025-4"},{"key":"RH2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90022-X"},{"key":"RH3","volume-title":"Introduction to formal language theory","author":"Harrison M.","year":"1978"},{"key":"RHKP","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90003-4"},{"key":"RHMM","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036915"},{"key":"RHPS","doi-asserted-by":"crossref","unstructured":"D. Harel, A. Pnueli, J. Stavi,  Propositional dynamic logic on context-free programs,  Proc. 22nd IEEE Symposium on the Foundations of Computer Science,  310\u2013321","DOI":"10.1109\/SFCS.1981.38"},{"key":"RM","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0064872"},{"key":"RNI","doi-asserted-by":"publisher","DOI":"10.1007\/BF00286492"},{"key":"RPA1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.2"},{"key":"RPA2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-11160-3_4"},{"key":"RPR","doi-asserted-by":"crossref","unstructured":"V. R. Pratt,  Process Logic,  Proc. 6th Annual ACM Symposium on Principles of Programming Languages,  1979,  93\u2013100, Jan.","DOI":"10.1145\/567752.567761"},{"key":"RR","first-page":"1","volume":"141","author":"Rabin M.","year":"1969","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:02Z","timestamp":1787337602000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214066"],"URL":"https:\/\/doi.org\/10.1137\/0214066","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}