{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:16Z","timestamp":1761610516270,"version":"build-2065373602"},"reference-count":9,"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)80679-6","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"18-28","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Semantic Reachability"],"prefix":"10.1016","volume":"5","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80679-6_BIB1","series-title":"In MFCS'95, number 969 in LNCS","article-title":"An elementary bisimulation decision procedure for arbitrary context-free processes","author":"Burkart","year":"1995"},{"key":"10.1016\/S1571-0661(05)80679-6_BIB2","series-title":"Proceedings of CONCUR'93, number 715 in LNCS","article-title":"Bisimulation equivalence is decidable for basic parallel processes","author":"Christensen","year":"1993"},{"key":"10.1016\/S1571-0661(05)80679-6_BIB3","series-title":"In Proceedings of LICS'93.","article-title":"Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes","author":"Christensen","year":"1993"},{"key":"10.1016\/S1571-0661(05)80679-6_BIB4","unstructured":"Javier Esparza. Decidability of model checking for infinite-state concurrent systems. To appear in Acta Informatica."},{"key":"10.1016\/S1571-0661(05)80679-6_BIB5","series-title":"Fundamentals of Computation Theory, number 965 in LNCS","article-title":"Petri nets, commutative context-free grammars and basic parallel processes","author":"Esparza","year":"1995"},{"key":"10.1016\/S1571-0661(05)80679-6_BIB6","series-title":"Technical report, LFCS report series 94-286","article-title":"A polynomial algorithm for deciding bisimulation of normed context free processes","author":"Hirshfeld","year":"1994"},{"key":"10.1016\/S1571-0661(05)80679-6_BIB7","series-title":"Theoretical Computer Science","article-title":"Undecidability of bisimilarity for petri nets and some related problems","author":"Jan\u010dar","year":"1995"},{"key":"10.1016\/S1571-0661(05)80679-6_BIB8","series-title":"Proceedings of CONCUR'95, number 962 in LNCS","article-title":"Checking regular properties of petri nets","author":"Jan\u010dar","year":"1995"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80679-6_BIB9"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806796?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:08:46Z","timestamp":1761610126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":9,"alternative-id":["S1571066105806796"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80679-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":"Semantic Reachability","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)80679-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}