Counting Petri net markings from reduction equations

Behle, M., Eisenbrand, F.: 0/1 vertex and facet enumeration with BDDs. In: 9th Workshop on Algorithm Engineering and Experiments. SIAM (2007)

Berthelot, G.: Checking properties of nets using transformations. In: European Workshop on Applications and Theory in Petri Nets, pp. 19–40. Springer (1985)

Berthelot, G.: Transformations and decompositions of nets. In: Advanced Course on Petri Nets, pp. 359–376. Springer (1986)

Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Petri net reductions for counting markings. In: International Symposium on Model Checking Software, volume 10869 of LNCS, pp. 65–84. Springer (June 2018)

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–2756 (2004)

Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)

De Loera, J.A., Hemmecke, R., Köppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. SIAM, Philadelphia (2013)

De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273–1302 (2004)

Esparza, J., Schröter, C.: Net reductions for LTL model-checking. In: Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pp. 310–324. Springer (2001)

Kordon, F., et al.: Complete Results for the 2018 Edition of the Model Checking Contest. http://mcc.lip6.fr/2018/results.php (June 2018)

Kordon, F., et al. MCC’2017—the seventh model checking contest. In: Transactions on Petri Nets and Other Models of Concurrency XIII, pp. 181–209. Springer (2018)

Hack, M.: Decidability questions for Petri Nets. PhD thesis, Massachusetts Institute of Technology (1976)

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)

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–318. Springer (2016)

Levy, F.K., Thompson, G.L., Wiest, J.D.: Introduction to the critical-path method. Industrial Scheduling. Prentice-Hall, Englewood Cliffs (1963)

Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall PTR, Upper Saddle River (1981)

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. 4, pp. 3768–3773 (1997)

Schmidt, K.: Using Petri net invariants in state space construction. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 473–488 (2003)

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–373. Springer (1996)

Stahl, C.: Decomposing Petri net state spaces. In: 18th German Workshop on Algorithms and Tools for Petri Nets (AWPN 2011), Hagen, Germany (Sep 2011)

Thierry-Mieg, Y., Poitrenaud, D., Hamez, A., Kordon, F.: Hierarchical set decision diagrams and regular models. In: TACAS—Tools and Algorithms for the Construction and Analysis of Systems, pp. 1–15 (2009)

Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using barvinok’s rational functions. Algorithmica 48(1), 37–66 (2007)

Wolf, K.: Generating Petri net state spaces. In: Petri Nets and Other Models of Concurrency-ICATPN 2007, pp. 29–42 (2007)