This thesis is about improving the feasibility of model checking (MC) and model-based testing (MBT) for practical application. For this goal, lazy techniques, parallelizations, and other optimizations are devised. All mentioned improvements are substantiated by experiments. For model checking, feasibility is increased for one of the most important liveness livelock freedom. A lazy, more feasible and parallel MC algorithm that is specialized on livelock freedom is derived. It can efficiently use an adapted partial order reduction. For model-based testing of safety properties, a lazy approach is designed. It is more feasible and can handle uncontrollable nondeterminism in the system under test. It integrates both on-the-fly and offline MBT by swapping heuristically between phases of state space traversal and test execution. The traversal can thus make use of dynamic information from previous test execution while searching for meaningful test cases. A parallel algorithm following this approach is implemented, as well as various heuristics making use of dynamic information. This dissertation (except for the figures listed on page ii) is licensed under the Creative Commons Attribution 4.0 International License (CC BY 4.0). It is available in several • a free pdf at KIT’s open access • a kindle version • a print-on-demand back matter • a print-on-demand front matter and main Either colored or in black and white. The colored version contains 24 figures and 11 listings with color that facilitates (but is not required for) understanding. This book is the colored version of the front matter and main matter of the dissertation, self-contained, and with thorough introductions.