{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:04:20Z","timestamp":1776305060948,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:00:00Z","timestamp":1556582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10009-019-00519-1","type":"journal-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T17:29:36Z","timestamp":1556645376000},"page":"163-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Counting Petri net markings from reduction equations"],"prefix":"10.1007","volume":"22","author":[{"given":"Bernard","family":"Berthomieu","sequence":"first","affiliation":[]},{"given":"Didier","family":"Le Botlan","sequence":"additional","affiliation":[]},{"given":"Silvano","family":"Dal Zilio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,30]]},"reference":[{"key":"519_CR1","doi-asserted-by":"crossref","unstructured":"Behle, M., Eisenbrand, F.: 0\/1 vertex and facet enumeration with BDDs. In: 9th Workshop on Algorithm Engineering and Experiments. SIAM (2007)","DOI":"10.1137\/1.9781611972870.15"},{"key":"519_CR2","doi-asserted-by":"crossref","unstructured":"Berthelot, G.: Checking properties of nets using transformations. In: European Workshop on Applications and Theory in Petri Nets, pp. 19\u201340. Springer (1985)","DOI":"10.1007\/BFb0016204"},{"key":"519_CR3","doi-asserted-by":"crossref","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Advanced Course on Petri Nets, pp. 359\u2013376. Springer (1986)","DOI":"10.1007\/978-3-540-47919-2_13"},{"key":"519_CR4","doi-asserted-by":"crossref","unstructured":"Berthomieu, B., Le\u00a0Botlan, D., Dal\u00a0Zilio, S.: Petri net reductions for counting markings. In: International Symposium on Model Checking Software, volume 10869 of LNCS, pp. 65\u201384. Springer (June 2018)","DOI":"10.1007\/978-3-319-94111-0_4"},{"issue":"14","key":"519_CR5","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1080\/00207540412331312688","volume":"42","author":"B Berthomieu","year":"2004","unstructured":"Berthomieu, B., Ribet, P.-O., Vernadat, F.: The tool TINA-construction of abstract state spaces for Petri nets and Time Petri nets. Int. J. Prod. Res. 42(14), 2741\u20132756 (2004)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"519_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F Commoner","year":"1971","unstructured":"Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511\u2013523 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"519_CR7","volume-title":"Algebraic and Geometric Ideas in the Theory of Discrete Optimization","author":"JA Loera De","year":"2013","unstructured":"De Loera, J.A., Hemmecke, R., K\u00f6ppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. SIAM, Philadelphia (2013)"},{"issue":"4","key":"519_CR8","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"JA Loera De","year":"2004","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273\u20131302 (2004)","journal-title":"J. Symb. Comput."},{"key":"519_CR9","doi-asserted-by":"crossref","unstructured":"Esparza, J., Schr\u00f6ter, C.: Net reductions for LTL model-checking. In: Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pp. 310\u2013324. Springer (2001)","DOI":"10.1007\/3-540-44798-9_25"},{"key":"519_CR10","unstructured":"Kordon, F., et\u00a0al.: Complete Results for the 2018 Edition of the Model Checking Contest. \nhttp:\/\/mcc.lip6.fr\/2018\/results.php\n\n (June 2018)"},{"key":"519_CR11","doi-asserted-by":"crossref","unstructured":"Kordon, F., et\u00a0al. MCC\u20192017\u2014the seventh model checking contest. In: Transactions on Petri Nets and Other Models of Concurrency XIII, pp. 181\u2013209. Springer (2018)","DOI":"10.1007\/978-3-662-58381-4_9"},{"key":"519_CR12","unstructured":"Hack, M.: Decidability questions for Petri Nets. PhD thesis, Massachusetts Institute of Technology (1976)"},{"key":"519_CR13","doi-asserted-by":"crossref","unstructured":"Hillah, L.M., Kordon, F.: Petri Nets Repository: a tool to benchmark and debug Petri Net tools. In: 38th International Conference on Petri Nets and Other Models of Concurrency (Petri Nets), LNCS, vol. 10258. Springer (June 2017)","DOI":"10.1007\/978-3-319-57861-3_9"},{"key":"519_CR14","doi-asserted-by":"crossref","unstructured":"Jensen, J.F., Nielsen, T., Oestergaard, L.K., Srba, J.: TAPAAL and reachability analysis of P\/T nets. In: Transactions on Petri Nets and Other Models of Concurrency XI, pp. 307\u2013318. Springer (2016)","DOI":"10.1007\/978-3-662-53401-4_16"},{"key":"519_CR15","volume-title":"Introduction to the critical-path method. Industrial Scheduling","author":"FK Levy","year":"1963","unstructured":"Levy, F.K., Thompson, G.L., Wiest, J.D.: Introduction to the critical-path method. Industrial Scheduling. Prentice-Hall, Englewood Cliffs (1963)"},{"key":"519_CR16","volume-title":"Petri Net Theory and the Modeling of Systems","author":"JL Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall PTR, Upper Saddle River (1981)"},{"key":"519_CR17","unstructured":"Recalde, L., Teruel, E., Silva, M.: Improving the decision power of rank theorems. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, vol.\u00a04, pp. 3768\u20133773 (1997)"},{"key":"519_CR18","doi-asserted-by":"crossref","unstructured":"Schmidt, K.: Using Petri net invariants in state space construction. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 473\u2013488 (2003)","DOI":"10.1007\/3-540-36577-X_35"},{"key":"519_CR19","doi-asserted-by":"crossref","unstructured":"Silva, M., Teruel, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place\/transition net systems. In: Advanced Course on Petri Nets, pp. 309\u2013373. Springer (1996)","DOI":"10.1007\/3-540-65306-6_19"},{"key":"519_CR20","unstructured":"Stahl, C.: Decomposing Petri net state spaces. In: 18th German Workshop on Algorithms and Tools for Petri Nets (AWPN 2011), Hagen, Germany (Sep 2011)"},{"key":"519_CR21","doi-asserted-by":"crossref","unstructured":"Thierry-Mieg, Y., Poitrenaud, D., Hamez, A., Kordon, F.: Hierarchical set decision diagrams and regular models. In: TACAS\u2014Tools and Algorithms for the Construction and Analysis of Systems, pp. 1\u201315 (2009)","DOI":"10.1007\/978-3-642-00768-2_1"},{"issue":"1","key":"519_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-006-1231-0","volume":"48","author":"S Verdoolaege","year":"2007","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using barvinok\u2019s rational functions. Algorithmica 48(1), 37\u201366 (2007)","journal-title":"Algorithmica"},{"key":"519_CR23","doi-asserted-by":"crossref","unstructured":"Wolf, K.: Generating Petri net state spaces. In: Petri Nets and Other Models of Concurrency-ICATPN 2007, pp. 29\u201342 (2007)","DOI":"10.1007\/978-3-540-73094-1_5"}],"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-019-00519-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-019-00519-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-019-00519-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:18:35Z","timestamp":1588115915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-019-00519-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,30]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["519"],"URL":"https:\/\/doi.org\/10.1007\/s10009-019-00519-1","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,30]]},"assertion":[{"value":"30 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}