{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:57Z","timestamp":1761610317056,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80473-6","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"185-205","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Process Rewrite Systems"],"prefix":"10.1016","volume":"7","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80473-6_BIB1","doi-asserted-by":"crossref","unstructured":"A. Bouajjani and P. Habermehl. Constrained properties, semilinear systems, and Petri nets. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, volume 1119 of LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_71"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB2","doi-asserted-by":"crossref","unstructured":"O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, volume 1119 of LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_59"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(05)80680-2","article-title":"More infinite results","volume":"5","author":"Burkart","year":"1997","journal-title":"Electronic Notes in Theoretical Computer Science (ENTCS)"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","article-title":"On the regular structure of prefix rewriting","volume":"106","author":"Caucal","year":"1992","journal-title":"Journal of Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB5","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993."},{"key":"10.1016\/S1571-0661(05)80473-6_BIB6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s002360050074","article-title":"Decidability of model checking for infinite-state concurrent systems","volume":"34","author":"Esparza","year":"1997","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB7","series-title":"CAV'95, volume 939 of LNCS","first-page":"353","article-title":"On the model checking problem for branching time logics and Basic Parallel Processes","author":"Esparza","year":"1995"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB8","series-title":"Foundations of Software Technology and Theoretical Computer Science (FSTTCS'96), volume 1180 of LNCS.","article-title":"Regularity is decidable for normed PA processes in polynomial time","author":"Kucera","year":"1996"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general Petri net reachability problem","volume":"13","author":"Mayr","year":"1984","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB10","series-title":"International Symposium on Theoretical Aspects of Computer Software (TACS'97), LNCS","article-title":"Combining Petri nets and PA-processes","author":"Mayr","year":"1997"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB11","doi-asserted-by":"crossref","unstructured":"Richard Mayr. Model checking PA-processes. In International Conference on Concurrency Theory (CONCUR'97), volume 1243 of LNCS. Springer Verlag, 1997.","DOI":"10.1007\/3-540-63141-0_23"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB12","series-title":"Analytic Tableaux and Related Methods (TABLEAUX'97), volume 1227 of LNAI.","article-title":"Tableau methods for PA-processes","author":"Mayr","year":"1997"},{"key":"10.1016\/S1571-0661(05)80473-6_BIB13","doi-asserted-by":"crossref","unstructured":"Faron Moller. Infinite results. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, volume 1119 of LNCS. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_56"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804736?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804736?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:06Z","timestamp":1761610026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":13,"alternative-id":["S1571066105804736"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80473-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Process Rewrite Systems","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80473-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}