{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:32Z","timestamp":1760202632370},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613633"},{"type":"electronic","value":"9783540685050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61363-3_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:22Z","timestamp":1330292122000},"page":"460-479","source":"Crossref","is-referenced-by-count":4,"title":["Behavioural equivalence for infinite systems \u2014 Partially decidable!"],"prefix":"10.1007","author":[{"given":"Kim","family":"Sunesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mogens","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"25_CR1","unstructured":"S. Abramsky, Eliminating Local Non-determinism: a New Semantics for CCS, Computer Systems Laboratory, Queen Mary College, Report no. 290 (1981)."},{"issue":"2","key":"25_CR2","first-page":"202","volume":"6","author":"L. Aceto","year":"1994","unstructured":"L. Aceto, A Static View of Localities, Formal Aspects of Computing, 6 (2), 202\u2013222 (1994).","journal-title":"A Static View of Localities, Formal Aspects of Computing"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(93)90152-J","volume":"114","author":"G. Boudol","year":"1993","unstructured":"G. Boudol, I. Castellani, M. Hennessy and A. Kiehn, Observing Localities, Theoretical Computer Science, 114, 31\u201361, 1993.","journal-title":"Observing Localities, Theoretical Computer Science"},{"key":"25_CR4","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras Ph.D. Thesis, University of Edinburgh, CST-105-93, 1993."},{"key":"25_CR5","first-page":"156","volume":"51","author":"S. Christensen","year":"1993","unstructured":"S. Christensen, H. H\u00fcttel, Decidability Issues for Infinite-State Processes \u2014 a Survey, EATCS Bulletin 51, 156\u2013166 (1993).","journal-title":"EATCS Bulletin"},{"key":"25_CR6","first-page":"143","volume":"715","author":"S. Christensen","year":"1993","unstructured":"S. Christensen, Y. Hirshfeld and F. Moller, Bisimulation equivalence is decidable for basic parallel processes, CONCUR '93, Springer LNCS 715, 143\u2013157 (1993).","journal-title":"Springer LNCS"},{"key":"25_CR7","unstructured":"J. Engelfriet, Tree automata and tree grammars, University of Aarhus, DAIMI FN-10 (1975)."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"J. Esparza, Petri nets, commutative context-free grammars, and Basic Parallel Processes, in Proceedings of Fundamentals of Computation Theory, (FCT'95), LNCS 965, Springer Verlag 1995.","DOI":"10.1007\/3-540-60249-6_54"},{"key":"25_CR9","first-page":"353","volume":"939","author":"J. Esparza","year":"1995","unstructured":"J. Esparza and A. Kiehn, On the Model Checking Problem for Branching Logics and Basic Parallel Processes, CAV '95, Springer LNCS 939, 353\u2013366 (1995).","journal-title":"Springer LNCS"},{"key":"25_CR10","first-page":"165","volume":"882","author":"Y. Hirshfeld","year":"1994","unstructured":"Y. Hirshfeld, Petri Nets and the Equivalence Problem, CSL '93, Springer LNCS 882, 165\u2013174 (1994).","journal-title":"Springer LNCS"},{"key":"25_CR11","unstructured":"C. A. R. Hoare, Communicating Sequential Processes, Prentice Hall, International Series in Computer Science (1985)."},{"key":"25_CR12","first-page":"454","volume":"789","author":"H. H\u00fctte","year":"1994","unstructured":"H. H\u00fctte, Undecidable Equivalences for Basic Parallel Processes, TACS '94, Springer LNCS 789, 454\u2013464 (1994).","journal-title":"Springer LNCS"},{"key":"25_CR13","first-page":"348","volume":"962","author":"P. Jancar","year":"1995","unstructured":"P. Jancar and F. Moller, Checking Regular Properties of Petri Nets, CONCUR '95, Springer LNCS 962, 348\u2013362 (1995).","journal-title":"Springer LNCS"},{"key":"25_CR14","first-page":"519","volume":"700","author":"L. Jategaonkar","year":"1993","unstructured":"L. Jategaonkar and A. Meyer, Deciding true concurrency equivalences on finite safe nets. ICALP '93, Springer LNCS 700, 519\u2013531 (1993).","journal-title":"Springer LNCS"},{"key":"25_CR15","first-page":"18","volume":"836","author":"A. Kiehn","year":"1994","unstructured":"A. Kiehn and M. Hennessy, On the Decidability on Non-interleaving Equivalences, CONCUR '94, Springer LNCS 836, 18\u201333 (1994)","journal-title":"Springer LNCS"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju. Decidability of Reachability in Vector Addition Systems. 14th Annual ACM Symposium on Theory of Computing, San Francisco, 267\u2013281 (1982).","DOI":"10.1145\/800070.802201"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00289268","volume":"15","author":"E.W. Mayr","year":"1981","unstructured":"E.W. Mayr, Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15, 309\u2013318 (1981).","journal-title":"Acta Informatica"},{"issue":"3","key":"25_CR18","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/322261.322271","volume":"28","author":"E.W. Mayr","year":"1981","unstructured":"E.W. Mayr and A.R. Meyer, The Complexity of the Finite Containment Problem for Petri Nets, Journal of the ACM, 28(3), 561\u2013576 (1981).","journal-title":"Journal of the ACM"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Basic notions of trace theory, in de Bakker, de Roever and Rozenberg (eds.), Linear Time, Branching Time and Partial Orders in Logics and Models for Concurrency, Springer LNCS 354, 285\u2013363 (1988).","DOI":"10.1007\/BFb0013025"},{"key":"25_CR20","unstructured":"A.R.G. Milner, Communication and concurrency, Prentice Hall (1989)."},{"key":"25_CR21","unstructured":"M.L. Minsky, Computation \u2014 Finite and Infinite Machines, Prentice Hall (1967)."},{"key":"25_CR22","first-page":"328","volume":"652","author":"M. Mukund","year":"1992","unstructured":"M. Mukund and M. Nielsen, CCS, Locations and Asynchronous Transition Systems, FST & TCS '92, Springer LNCS 652, 328\u2013341 (1992).","journal-title":"Springer LNCS"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.R. Olderog","year":"1986","unstructured":"E.R. Olderog and C.A.R. Hoare, Specification-Oriented Semantics for Communicating Processes, Acta Informatica, 23, 9\u201366 (1986).","journal-title":"Acta Informatica"},{"issue":"1","key":"25_CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"V.R. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, 15(1), 33\u201371 (1986).","journal-title":"International Journal of Parallel Programming"},{"issue":"5","key":"25_CR25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0020-0190(79)90115-7","volume":"8","author":"W. Reisig","year":"1979","unstructured":"W. Reisig, A note on the representation of finite tree automata. Information Processing Letters, 8(5):239\u2013240, June 1979","journal-title":"Information Processing Letters"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"W. Reisig, Petri Nets \u2014 an Introduction, EATCS Monograph in Computer Science, Springer (1985).","DOI":"10.1007\/978-3-642-69968-9"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"K. Sunesen and M. Nielsen, Behavioural equivalence for infinite systems \u2014 partially decidable!, Technical Report RS-95-55, BRICS, Aarhus University (1995).","DOI":"10.7146\/brics.v2i55.19956"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"D. Taubner, Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Springer LNCS 369 (1989).","DOI":"10.1007\/3-540-51525-9"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on Infinite Objects, in Handbook of Theoretical Computer Science, vol B, ed. J. van Leeuwen, Elsevier, 133\u2013192 (1990).","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"25_CR30","volume-title":"PhD thesis","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek, Comparative concurrency semantics and refinement of actions, PhD thesis, CWI Amsterdam (1990)."},{"key":"25_CR31","first-page":"237","volume":"379","author":"R.J. Glabbeek van","year":"1989","unstructured":"R.J. van Glabbeek and U. Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions, MFCS '89, Springer LNCS 379, 237\u2013248 (1989).","journal-title":"Springer LNCS"},{"key":"25_CR32","first-page":"233","volume":"715","author":"P. Wolper","year":"1993","unstructured":"P. Wolper and P. Godefroid, Partial Order Methods for Temporal Verification, Concur '93, Springer LNCS 715, 233\u2013246 (1993).","journal-title":"Springer LNCS"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61363-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:42Z","timestamp":1605647142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61363-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613633","9783540685050"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-61363-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}