M. Blondin, A. Finkel, and P. Mckenzie, Well behaved transition systems, Logical Methods in Computer Science, vol.13, issue.3, pp.1-19, 2017.

A. , Reduction and covering of infinite reachability trees. Information and Computation, vol.89, pp.144-179, 1990.

A. , The minimal coverability graph for Petri nets, Advances in Petri Nets, vol.674, pp.210-243, 1993.

A. Finkel and J. Goubault-larrecq, Forward analysis for WSTS, part II : Complete WSTS, Logical Methods in Comp. Science, vol.8, issue.4, 2012.

A. Finkel and G. Geeraerts, Jean-François Raskin, and Laurent Van Begin. A counter-example the the minimal coverability tree algorithm, 2005.

G. Geeraerts, J. Raskin, and L. Van-begin, On the efficient computation of the minimal coverability set of Petri nets, Int. J. Foundations of Computer Science, vol.21, issue.2, pp.135-165, 2010.

M. Hack, Decidability questions for Petri Nets, 1976.

R. M. Karp and R. E. Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.

J. Leroux, Distance Between Mutually Reachable Petri Net Configurations. working paper or preprint, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02156549

A. Piipponen and A. Valmari, Constructing minimal coverability sets, Fundamenta Informaticae, vol.143, issue.3-4, pp.393-414, 2016.

P. Reynier and F. Servais, Minimal coverability set for Petri nets : Karp and Miller algorithm with pruning, Fundamenta Informaticae, vol.122, issue.1-2, pp.1-30, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00554919

A. Valmari and H. Hansen, Old and new algorithms for minimal coverability sets, Fundamenta Informaticae, vol.131, issue.1, pp.1-25, 2014.

M. Yamamoto, S. Sekine, and S. Matsumoto, Formalization of karp-miller tree construction on petri nets, Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, pp.66-78, 2017.