Thomas Bourdeaud'huy Pascal Yim Saïd Hanafi Efficient reachability analysis of bounded Petri nets using constraint programming. 1870-1875 2004 conf/smc/2004 SMC (2) http://dx.doi.org/10.1109/ICSMC.2004.1399939 db/conf/smc/smc2004-2.html#BourdeaudhuyPS04