We exlain the three research topics: bounded model checking, SAT planning, and network update. Although computational problems considered in these topics (and also applications) are different, they are, in essence, required to compute some form of the reachability of states, and hence have a close relation with the emerging discipline of combinatorial reconfiguration. This talk aims to provide basic knowledge of these topics to make it possible to discuss how they are related to the combinatorial reconfiguration.