Rintanen, JussiGretton, Charles2015-12-10August 3-99781577356332http://hdl.handle.net/1885/66518We describe an approach to computing upper bounds on the lengths of solutions to reachability problems in transition systems. It is based on a decomposition of state-variable dependency graphs (causal graphs). Our approach is able to find practical upperAuthor/s retain copyright20132015-12-10