1. A static analysis technique for graph transformation systems;Baldan,2001
2. Finite unfoldings of unbounded Petri nets;Desel,2004
3. Verification of safety properties using integer programming: Beyond the state equation;Esparza;Formal Methods in System Design,2000
4. The minimal coverability graph for Petri nets;Finkel,1991
5. A. Finkel, G. Geeraerts, J.-F. Raskin, L. Van Begin, A counter-example to the minimal coverability tree algorithm, Technical Report 535, Université Libre de Bruxelles, 2005