{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T09:31:42Z","timestamp":1791192702529,"version":"4.1.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["STTT"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1007\/s10009-003-0110-0","type":"journal-article","created":{"date-parts":[[2004,3,19]],"date-time":"2004-03-19T13:53:20Z","timestamp":1079704400000},"page":"268-297","source":"Crossref","is-referenced-by-count":18,"title":["Covering sharing trees: a compact data structure for parameterized verification"],"prefix":"10.1007","volume":"5","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Van Begin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2004,3,1]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla PA, \u010cer\u0101ns K, Jonsson B, Tsay YK (1996) General decidability theorems for infinite-state systems. In: Proceedings of the 11th annual symposium on logic in computer science (LICS\u201996), New Brunswick, NJ, 27-30 July 1996. IEEE Press, New York, pp 313\u2013321","DOI":"10.1109\/LICS.1996.561359"},{"key":"110_CR2","unstructured":"Ajmone Marsan M, Balbo G, Conte G, Donatelli S, Franceschinis G (1995) Modelling with generalized stochastic Petri Nets. Wiley series in parallel computing. Wiley, New York"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e9rard B, Fribourg L (1999) Reachability analysis of (timed) Petri Nets using real arithmetic. In: Proceedings of the 10th international conference on concurrency theory (CONCUR\u201999), Eindhoven, August 1999. Lecture notes in computer science, vol 1664, Springer, Berlin Heidelberg New York, pp 178\u2013193","DOI":"10.1007\/3-540-48320-9_14"},{"key":"110_CR4","unstructured":"Boigelot B, Wolper P (1998) Verifying systems with infinite but regular state space. In: Proceedings of the 10th international conference on computer aided verification (CAV\u201998). Lecture notes in computer science, vol 1427, Springer, Berlin Heidelberg New York, pp 88\u201397"},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"Bouajjani A, Mayr R (1999) Model checking Lossy vector addition systems. In: Proceedings of the 16th annual symposium on theoretical aspects of computer science (STACS\u201999), Trier, Germany, March 1999. Lecture notes in computer science, vol 1563, Springer, Berlin Heidelberg New York, pp 323\u2013333","DOI":"10.1007\/3-540-49116-3_30"},{"key":"110_CR6","unstructured":"Burch JR, Clarke EM, McMillan KL, Dill DL, Hwang J (1990) Symbolic model checking: 1020 states and beyond. In: Proceedings of the 5th IEEE symposium on logic in computer science (LICS\u201990), Philadelphia, PA, 4-7 June 1990. IEEE Press, New York, pp 428\u2013439"},{"key":"110_CR7","doi-asserted-by":"crossref","unstructured":"Bultan T, Gerber R, Pugh W (1997) Symbolic model checking of infinite-state systems using Presburger arithmetics. In: Prococeedings of the 9th international conference on computer aided verification (CAV\u201997), Haifa, Israel, July 1997. Lecture notes in computer science, vol 1254, Springer, Berlin Heidelberg New York, pp 400\u2013411","DOI":"10.1007\/3-540-63166-6_39"},{"key":"110_CR8","doi-asserted-by":"crossref","unstructured":"Bultan T (2000) BDD vs. constraint-based model checking: an experimental evaluation for asynchronous concurrent systems. In: Proceedings of the 6th international conference on tools and algorithms for the construction and analysis of systems (TACAS 2000). Lecture notes in computer science, vol 1785, Springer, Berlin Heidelberg New York, pp 441\u2013455","DOI":"10.1007\/3-540-46419-0_30"},{"key":"110_CR9","doi-asserted-by":"crossref","unstructured":"\u010cer\u0101ns K (1994) Deciding properties of integral relational automata. In: Proceedings of the 21st international colloquium on automata and languages for programming (ICALP 94), Jerusalem, Israel, 11-14 July 1994. Lecture notes in computer science, vol 820, Springer, Berlin Heidelberg New York, pp 35\u201346","DOI":"10.1007\/3-540-58201-0_56"},{"issue":"1\u20132","key":"110_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-5316(95)00008-L","volume":"24","author":"G Chiola","year":"1995","unstructured":"Chiola G, Franceschinis G, Gaeta R, Ribaudo M (1995) GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri Nets. Perform Eval 24(1\u20132):47\u201368","journal-title":"Perform Eval"},{"key":"110_CR11","unstructured":"Ciardo G (1994) Petri nets with marking-dependent arc multiplicity: properties and analysis. In: Proceedings of the 15th international conference on applications and theory of Petri Nets (ICATPN 94), Zaragoza, Spain, June 1994. Lecture notes in computer science, vol 815, Springer, Berlin Heidelberg New York, pp 179\u2013198"},{"key":"110_CR12","doi-asserted-by":"crossref","unstructured":"Delzanno G, Esparza J, Podelski A (1999) Constraint-based analysis of broadcast protocols. In: Proceedings of the 13th annual conference of the European Association for Computer Science Logic (CSL\u201999), Chennai, India, 13-15 December 1999. Lecture notes in computer science, vol 1683, Springer, Berlin Heidelberg New York, pp 50\u201366","DOI":"10.1007\/3-540-48168-0_5"},{"key":"110_CR13","doi-asserted-by":"crossref","unstructured":"Delzanno G, Raskin JF (2000) Symbolic representation of upward closed sets. In: Proceedings of the 6th international conference on tools and algorithms for the construction and analysis of systems (TACAS 2000), Berlin, Germany, March\/April 2000. Lecture notes in computer science, vol 1785, Springer, Berlin Heidelberg New York, pp 426\u2013440. Technical report MPI-I-1999-2-007, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, November 1999","DOI":"10.1007\/3-540-46419-0_29"},{"key":"110_CR14","doi-asserted-by":"crossref","unstructured":"Delzanno G, Raskin JF, Van Begin L (2001) Attacking symbolic state explosion. In: Proceedings of the 13th international conference on computer aided verification (CAV 2001), Paris, France, 18-22 July 2001. Lecture notes in computer science, vol 2102, Springer, Berlin Heidelberg New York, pp 298\u2013310. Technical report 441, Universit\u00e8 Libre de Bruxelles, January 2001","DOI":"10.1007\/3-540-44585-4_28"},{"key":"110_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"Dickson","year":"1913","unstructured":"Dickson LE (1913) Finiteness of the odd perfect and primitive abundant numbers with r distinct prime factors. Am J Math 35:413\u2013422","journal-title":"Am J Math"},{"key":"110_CR16","doi-asserted-by":"crossref","unstructured":"Emerson EA, Namjoshi KS (1998) On model checking for non-deterministic infinite-state systems. In: Proceedings of the 13th annual symposium on logic in computer science (LICS \u201998), Indiana, IN, 21-24 June 1998. IEEE Press, New York, pp 70\u201380","DOI":"10.1109\/LICS.1998.705644"},{"key":"110_CR17","doi-asserted-by":"crossref","unstructured":"Esparza J, Finkel A, Mayr R (1999) On the verification of broadcast protocols. In: Proceedings of the 14th annual symposium on logic in computer science (LICS\u201999), Trento, Italy, 2-5 July 1999. IEEE Press, New York, pp 352\u2013359","DOI":"10.1109\/LICS.1999.782630"},{"key":"110_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008743212620","volume":"16","author":"Esparza","year":"2000","unstructured":"Esparza J, Melzer S (2000) Verification of safety properties using integer programming: beyond the state equation. Formal Meth Sys Design 16:159\u2013189","journal-title":"Formal Meth Sys Design"},{"key":"110_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"Finkel","year":"1990","unstructured":"Finkel A (1990) Reduction and covering of infinite reachability trees. Inform Comput 89(2):144\u2013179","journal-title":"Inform Comput"},{"key":"110_CR20","doi-asserted-by":"crossref","unstructured":"Finkel A (1993) The minimal coverability graph for Petri Nets. In: Rozenberg G (ed) Advances in Petri Nets \u201993, papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, June 1991. Lecture notes in computer science, vol 674, Springer, Berlin Heidelberg New York, pp 210\u2013243","DOI":"10.1007\/3-540-56689-9_45"},{"issue":"1\u20132","key":"110_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel A, Schnoebelen P (2001) Well-structured transition systems everywhere! Theor Comput Sci 256(1\u20132):63\u201392","journal-title":"Theor Comput Sci"},{"key":"110_CR22","unstructured":"Fra\u00efss\u00e9 R (2000) Theory of relations.. Studies in logic and the foundations of mathematics, Elsevier, Amsterdam"},{"key":"110_CR23","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"German","year":"1992","unstructured":"German SM, Sistla AP (1992) Reasoning about systems with many processes. J ACM 39(3):675\u2013735","journal-title":"J ACM"},{"key":"110_CR24","doi-asserted-by":"crossref","unstructured":"Grahlmann B (1997) The PEP tool. In: Proceedings of the 9th conference on computer aided verification (CAV\u201997), Haifa, Israel, June 1997. Lecture notes in computer science, vol 1254, Springer, Berlin Heidelberg New York, pp 440\u2013443","DOI":"10.1007\/3-540-63166-6_43"},{"key":"110_CR25","doi-asserted-by":"crossref","unstructured":"Henzinger MR, Henzinger TA, Kopke PK (1995) Computing simulations on finite and infinite graphs. In: Proceedings of the 36th annual IEEE symposium on foundations of computer science (FOCS\u201995), Milwaukee, WI, 23-25 October 1995. IEEE Press, New York, pp 453\u2013462","DOI":"10.1109\/SFCS.1995.492576"},{"key":"110_CR26","doi-asserted-by":"crossref","unstructured":"Henzinger TA, Ho PH, Wong-Toi H (1997) HyTech: a model checker for hybrid systems. In: Proceedings of the 9th conference on computer aided verification (CAV\u201997), Haifa, Israel, June 1997. Lecture notes in computer science, vol 1254, Springer, Berlin Heidelberg New York, pp 460\u2013463","DOI":"10.1007\/3-540-63166-6_48"},{"key":"110_CR27","doi-asserted-by":"crossref","unstructured":"Johnson DS (1990) A catalog of complexity classes. In: Van Leeuwen J (ed) Handbook of theoretical computer science, vol A: Algorithm and complexity. Elsevier, Amsterdam","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"110_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"Karp","year":"1969","unstructured":"Karp RM, Miller RE (1969) Parallel program schemata. J Comput Sys Sci 3:147\u2013195","journal-title":"J Comput Sys Sci"},{"key":"110_CR29","unstructured":"Kesten Y, Maler O, Marcus M, Pnueli A, Shahar E (1997) Symbolic model checking with rich assertional languages. In: Proceedings of the 9th international conference on computer aided verification (CAV \u201997), Haifa, Israel, June 1997. Lecture notes in computer science, vol 1254, Springer, Berlin Heidelberg New York, pp 424\u2013435"},{"key":"110_CR30","doi-asserted-by":"crossref","unstructured":"Miner A, Ciardo G (1999) Efficient reachability set generation and storage using decision diagrams. In: Proceedings of th 20th international conference on applications and theory of Petri Nets (ICATPN \u201999), Williamsburg, VA, USA, June 1999. Lecture notes in computer science, vol 1639, Springer, Berlin Heidelberg New York, pp 6\u201325","DOI":"10.1007\/3-540-48745-X_2"},{"key":"110_CR31","unstructured":"Minsky NM (1967) Finite and infinite machines. Prentice-Hall, Upper Saddle River, NJ"},{"key":"110_CR32","doi-asserted-by":"crossref","unstructured":"M\u00f8ller J, Lichtenberg J, Andersen HR, Hulgaard H (1999) Difference decision diagrams. In: Proceedings of the 13th annual conference of the European Association for Computer Science Logic (CSL\u201999), Madrid, Spain, 20-25 September 1999. Lecture notes in computer science, vol 1683, Springer, Berlin Heidelberg New York, pp 111\u2013125","DOI":"10.1007\/3-540-48168-0_9"},{"key":"110_CR33","first-page":"an","volume":"Nets","author":"Reisig","year":"1986","unstructured":"Reisig W (1986) Petri Nets: an introduction. EATCS monographs on theoretical computer science. Springer, Berlin Heidelberg New York","journal-title":"Petri"},{"key":"110_CR34","doi-asserted-by":"crossref","unstructured":"Silva M, Teruel E, Colom JM (1998) Linear algebraic and linear programming techniques for analysis of place\/transition net systems. In: Proceedings of Advances in Petri Nets, Lisbon, Portugal,22-26 June 1998. Lecture notes in computer science, vol 1491, Springer, Berlin Heidelberg New York, pp 308\u2013309","DOI":"10.1007\/3-540-65306-6_19"},{"key":"110_CR35","doi-asserted-by":"crossref","unstructured":"Teruel E (1994) Structure theory of weighted place\/transition net systems: the equal conflict hiatus. PhD thesis, University of Zaragoza, Spain","DOI":"10.1007\/3-540-58152-9_27"},{"key":"110_CR36","first-page":"theory","volume":"structure","author":"Zampuni\u00e9ris","year":"1997","unstructured":"Zampuni\u00e9ris D (1997) The sharing tree data structure: theory and applications in formal verification. PhD thesis, Facult\u00e9s Universitaires Notre-Dame de la Paix, Namur, Belgium","journal-title":"The sharing tree data"},{"key":"110_CR37","doi-asserted-by":"crossref","unstructured":"Zampuni\u00e9ris D, Le Charlier B (1995) Efficient handling of large sets of tuples with sharing trees. In: Proceedings of the data compressions conference (DCC\u201995), Snowbird, UT, USA, 28-30 March 1995, p 428","DOI":"10.1109\/DCC.1995.515538"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-003-0110-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-003-0110-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-003-0110-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-003-0110-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T03:25:17Z","timestamp":1559100317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-003-0110-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":37,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s10009-003-0110-0","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}