{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:43:55Z","timestamp":1773654235754,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0890-5401(90)90009-7","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"144-179","source":"Crossref","is-referenced-by-count":58,"title":["Reduction and covering of infinite reachability trees"],"prefix":"10.1016","volume":"89","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90009-7_BIB1","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0890-5401(90)90009-7_BIB2","series-title":"Proceedings, Comp. Network Protocols Symp.","first-page":"361","article-title":"Finite state description of communication protocols","author":"Bochmann","year":"1978"},{"key":"10.1016\/0890-5401(90)90009-7_BIB3_1","author":"Bochmann","year":"1988","journal-title":"Impact of Queued Interaction on Protocol Specification and Verification"},{"key":"10.1016\/0890-5401(90)90009-7_BIB3_2","series-title":"2nd International Symposium on Interoperable information Systems (ISIIS'88)","author":"Bochmann","year":"1988"},{"key":"10.1016\/0890-5401(90)90009-7_BIB4","volume":"Vol. 1","author":"Brams","year":"1983"},{"key":"10.1016\/0890-5401(90)90009-7_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite state machines","volume":"2","author":"Brand","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90009-7_BIB6","series-title":"Petri nets: Central models and their properties","volume":"Vol. 255","year":"1986"},{"key":"10.1016\/0890-5401(90)90009-7_BIB7","article-title":"Analyse et propri\u00e9t\u00e9s des processus communiquant par files fifo: R\u00e9seaux \u00e0 files \u00e0 choix libre topologique et r\u00e9seaux \u00e0 files lin\u00e9aires","author":"Choquet","year":"1987"},{"key":"10.1016\/0890-5401(90)90009-7_BIB8","author":"Choquet","year":"1987"},{"key":"10.1016\/0890-5401(90)90009-7_BIB9","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","article-title":"Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors","volume":"35","author":"Dickson","year":"1913","journal-title":"Amer. J. Math."},{"key":"10.1016\/0890-5401(90)90009-7_BIB10","article-title":"Structuration des syst\u00e8mes de transitions: Applications au contr\u00f4le du parall\u00e9lisme par files Fifo","author":"Finkel","year":"1986","journal-title":"Th\u00e8se d'Etat Universit\u00e9 d'Orsay"},{"key":"10.1016\/0890-5401(90)90009-7_BIB11","series-title":"14th International Colloquim Automata, Languages, Programming","first-page":"409","article-title":"A generalization of the procedure of Karp and Miller to well structured transition systems","volume":"Vol. 267","author":"Finkel","year":"1987"},{"key":"10.1016\/0890-5401(90)90009-7_BIB12","first-page":"209","article-title":"On deadlock detection in systems of communicating finite state machines","author":"Finkel","year":"1988"},{"key":"10.1016\/0890-5401(90)90009-7_BIB13","author":"Hack","year":"1975"},{"key":"10.1016\/0890-5401(90)90009-7_BIB14","author":"Hack","year":"1976","journal-title":"Decidability Questions for Petri Nets"},{"key":"10.1016\/0890-5401(90)90009-7_BIB15","series-title":"Proceedings, London Math. Soc. 2","article-title":"Ordering by divisibility in abstract algebras","author":"Higman","year":"1952"},{"key":"10.1016\/0890-5401(90)90009-7_BIB16","author":"Hopcroft","year":"1979"},{"issue":"3","key":"10.1016\/0890-5401(90)90009-7_BIB17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(81)90049-9","article-title":"Coloured Petri nets and the invariants method","volume":"14","author":"Jensen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90009-7_BIB18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"4","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90009-7_BIB19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(82)90014-9","article-title":"Homomorphisms between models of parallel computation","volume":"25","author":"Kasai","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90009-7_BIB20","author":"Keller","year":"1972"},{"issue":"7","key":"10.1016\/0890-5401(90)90009-7_BIB21","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel program","volume":"19","author":"Keller","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0890-5401(90)90009-7_BIB22","author":"Koenig","year":"1936"},{"key":"10.1016\/0890-5401(90)90009-7_BIB23","series-title":"Proceedings, 14th Ann. ACM Symp. on Theor. of Comp.","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982"},{"key":"10.1016\/0890-5401(90)90009-7_BIB24","doi-asserted-by":"crossref","DOI":"10.1016\/0097-3165(72)90063-5","article-title":"The theory of well-quasi-ordering: A frequently rediscovered concept","volume":"13","author":"Kruskal","year":"1972","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0890-5401(90)90009-7_BIB25","article-title":"An algorithm for the general Petri net reachability problem","volume":"Vol. 13","author":"Mayr","year":"1984"},{"key":"10.1016\/0890-5401(90)90009-7_BIB26","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(85)90014-3","article-title":"An introduction to Fifo nets\u2014monogeneous nets: A subclass of Fifo nets","volume":"35","author":"Memmi","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90009-7_BIB27","series-title":"6th Inter. Workshop on Protocol Specification, Testing, and Verification","article-title":"Protocol description and analysis based on a state transition model with channel expressions","author":"Pachl","year":"1986"},{"key":"10.1016\/0890-5401(90)90009-7_BIB32","unstructured":"Parigot, M. (1986), Private communication."},{"key":"10.1016\/0890-5401(90)90009-7_BIB28","author":"Peterson","year":"1981"},{"key":"10.1016\/0890-5401(90)90009-7_BIB29","series-title":"Proceedings, 8th Ann. Conf. on Inf. Sci. and Syst.","first-page":"663","article-title":"On deciding progress for a class of communicating protocols","author":"Rosier","year":"1984"},{"issue":"1","key":"10.1016\/0890-5401(90)90009-7_BIB30","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(86)90110-6","article-title":"Boundedness, empty channel detection, and synchronisation for communicating finite automata","volume":"44","author":"Rosier","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90009-7_BIB31","doi-asserted-by":"crossref","DOI":"10.1007\/BF00289715","article-title":"The residue of vector sets with applications to decidability problems in Petri nets","volume":"21","author":"Valk","year":"1985","journal-title":"Acta Inform."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540190900097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540190900097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:25:41Z","timestamp":1549027541000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540190900097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0890540190900097"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90009-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}