{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:09:40Z","timestamp":1775052580317,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540642756","type":"print"},{"value":"9783540697152","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054314","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:37:37Z","timestamp":1149658657000},"page":"102-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Fundamental structures in Well-Structured infinite Transition Systems"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Schnoebelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, K. \u010der\u0101ns, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Symp. Logic in Computer Science (LICS'96), New Brunswick, NJ, USA, July 1996, pages 313\u2013321, 1996.","DOI":"10.1109\/LICS.1996.561359"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In Proc. 8th IEEE Symp. Logic in Computer Science (LICS'93), Montreal, Canada, June 1993, pages 160\u2013170, 1993.","DOI":"10.1109\/LICS.1993.287591"},{"key":"10_CR3","first-page":"316","volume-title":"Lecture Notes in Computer Science","author":"P. A. Abdulla","year":"1994","unstructured":"P. A. Abdulla and B. Jonsson. Undecidability of verifying programs with unreliable channels. In Proc. 21st Int. Coll. Automata, Languages, and Programming (ICALP'94), Jerusalem, Israel, July 1994, volume 820 of Lecture Notes in Computer Science, pages 316\u2013327. Springer-Verlag, 1994."},{"key":"10_CR4","volume-title":"Methods and Tools for the Verification of Infinite State Systems","author":"P. A. Abdulla","year":"1997","unstructured":"P. A. Abdulla and B. Jonsson. Model-checking through constraint solving. In Methods and Tools for the Verification of Infinite State Systems, Proceedings of the Grenoble-Alpe d'Huez European School of Computer Science, May 23\u201325, Grenoble, France. VERIMAG, St-Martin d'H\u00e8res, France, 1997."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proc. Parallel Architectures and Languages Europe (PARLE'87), Eindhoven, NL, June 1987, vol. II: Parallel Languages, volume 259 of Lecture Notes in Computer Science, pages 94\u2013111. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"issue":"1\u20132","key":"10_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M. C. Browne","year":"1988","unstructured":"M. C. Browne, E. M. Clarke, and O. Gr\u00fcmberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1\u20132):115\u2013131, 1988.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J. R. Burch","year":"1992","unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142\u2013170, 1992.","journal-title":"Information and Computation"},{"key":"10_CR8","first-page":"361","volume":"2","author":"G. von Bochmann","year":"1978","unstructured":"G. von Bochmann. Finite state description of communication protocols. Computer Networks and ISDN Systems, 2:361\u2013372, 1978.","journal-title":"Computer Networks and ISDN Systems"},{"key":"10_CR9","unstructured":"A. Bonchatbonrat. Concise Holmesian proofs for elementary Moncher-Watson problems. In A. Mycroft, editor, Proc. 3rd Int. Conf. Theor. Crim. Deduction, London, November 1894."},{"key":"10_CR10","volume-title":"Etat de l'art des techniques d'analyse des automates finis communicants","author":"G. C\u00e9c\u00e9","year":"1993","unstructured":"G. C\u00e9c\u00e9. Etat de l'art des techniques d'analyse des automates finis communicants. Rapport de DEA, Universit\u00e9 de Paris-Sud, Orsay, France, September 1993."},{"key":"10_CR11","first-page":"35","volume-title":"Lecture Notes in Computer Science","author":"K. \u010der\u0101ns","year":"1994","unstructured":"K. \u010der\u0101ns. Deciding properties of integral relational automata. In Proc. 21st Int. Coll. Automata, Languages, and Programming (ICALP'94), Jerusalem, Israel, July 1994, volume 820 of Lecture Notes in Computer Science, pages 35\u201346. Springer-Verlag, 1994."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1995","unstructured":"G. C\u00e9c\u00e9, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20\u201331, 1995.","journal-title":"Information and Computation"},{"key":"10_CR13","series-title":"CST-105-93","volume-title":"PhD thesis","author":"S. Christensen","year":"1993","unstructured":"S. Christensen. Decidability and decomposition in process algebras. PhD thesis CST-105-93, Dept. of Computer Science, University of Edinburgh, UK, 1993."},{"key":"10_CR14","first-page":"179","volume-title":"Lecture Notes in Computer Science","author":"G. Ciardo","year":"1994","unstructured":"G. Ciardo. Petri nets with marking-dependent arc cardinality: Properties and analysis. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 179\u2013198. Springer-Verlag, 1994."},{"key":"10_CR15","volume-title":"Electronic Notes in Theor. Comp. Sci.","author":"J. Esparza","year":"1997","unstructured":"J. Esparza. More infinite results. In Proc. 1st Int. Workshop on Verification of Infinite State Systems (INFINITY'96), Pisa, Italy, Aug. 1996, volume 5 of Electronic Notes in Theor. Comp. Sci. Elsevier, 1997."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00268843","volume":"25","author":"A. Finkel","year":"1987","unstructured":"A. Finkel and A. Choquet. Fifo nets without order deadlock. Acta Informatica, 25(1):15\u201336, 1987.","journal-title":"Acta Informatica"},{"key":"10_CR17","unstructured":"A. Finkel. About monogeneous fifo Petri nets. In Proc. 3rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, Sep. 1982, pages 175\u2013192, 1982."},{"key":"10_CR18","first-page":"499","volume-title":"volume 267 of Lecture Notes in Computer Science","author":"A. Finkel","year":"1987","unstructured":"A. Finkel. A generalization of the procedure of Karp and Miller to well structured transition systems. In Proc. 14th Int. Coll. Automata, Languages, and Programming (ICALP'87), Karlsruhe, FRG, July 1987, volume 267 of Lecture Notes in Computer Science, pages 499\u2013508. Springer-Verlag, 1987."},{"key":"10_CR19","volume-title":"Research Report 365","author":"A. Finkel","year":"1987","unstructured":"A. Finkel. Well structured transition systems. Research Report 365, Lab. de Recherche en Informatique (LRI), Univ. Paris-Sud, Orsay, August 1987."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144\u2013179, 1990.","journal-title":"Information and Computation"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"A. Finkel. The minimal coverability graph algorithm. In Advances in Petri Nets 1993, volume 674 of Lecture Notes in Computer Science, pages 210\u2013243. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56689-9_45"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02277857","volume":"7","author":"A. Finkel","year":"1994","unstructured":"A. Finkel. Decidability of the termination problem for completely specificied protocols. Distributed Computing, 7:129\u2013135, 1994.","journal-title":"Distributed Computing"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"M. G. Gouda and L. E. Rosier. Synchronizable networks of communicating finite state machines. Unpublished manuscript, 1985.","DOI":"10.1137\/0214042"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137\u2013161, 1985.","journal-title":"Journal of the ACM"},{"key":"10_CR25","volume-title":"volume 5 of Electronic Notes in Theor. Comp. Sci.","author":"O. Kouchnarenko","year":"1997","unstructured":"O. Kouchnarenko and Ph. Schnoebelen. A model for recursive-parallel programs. In Proc. 1st Int. Workshop on Verification of Infinite State Systems (INFINITY'96), Pisa, Italy, Aug. 1996, volume 5 of Electronic Notes in Theor. Comp. Sci. Elsevier, 1997."},{"key":"10_CR26","first-page":"338","volume-title":"volume 815 of Lecture Notes in Computer Science","author":"C. Lakos","year":"1994","unstructured":"C. Lakos and S. Christensen. A general approach to arc extensions for coloured Petri nets. In Proc. 15th Int. Conf. Applications and Theory of Petri Nets, Zaragoza, Spain, June 1994, volume 815 of Lecture Notes in Computer Science, pages 338\u2013357. Springer-Verlag, 1994."},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/BF01936139","volume":"25","author":"E. M\u00e4kinen","year":"1985","unstructured":"E. M\u00e4kinen. On permutation grammars generating context-free languages. BIT, 25:604\u2013610, 1985.","journal-title":"BIT"},{"key":"10_CR28","first-page":"195","volume-title":"volume 1119 of Lecture Notes in Computer Science","author":"F. Moller","year":"1996","unstructured":"F. Moller. Infinite results. In Proc. 7th Int. Conf. Concurrency Theory (CONCUR'96), Pisa, Italy, Aug. 1996, volume 1119 of Lecture Notes in Computer Science, pages 195\u2013216. Springer-Verlag, 1996."},{"key":"10_CR29","first-page":"464","volume-title":"volume 62 of Lecture Notes in Computer Science","author":"R. Valk","year":"1978","unstructured":"R. Valk. Self-modifying nets, a natural extension of Petri nets. In Proc. 5th Int. Coll. Automata, Languages, and Programming (ICALP'78), Udine, Italy, Jul. 1978, volume 62 of Lecture Notes in Computer Science, pages 464\u2013476. Springer-Verlag, 1978."},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"R. Valk and M. Jantzen. The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica, 21:643\u2013674, 1985.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","LATIN'98: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:11:41Z","timestamp":1736406701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642756","9783540697152"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0054314","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}