STORM_LOG_ASSERT(l>=storm::utility::zero<ValueType>()&&u>=storm::utility::zero<ValueType>(),"Gap computation currently does not handle negative values.");
if(storm::utility::isInfinity(u)){
if(storm::utility::isInfinity(l)){
returnstorm::utility::zero<ValueType>();
}else{
returnu;
}
}elseif(storm::utility::isZero(u)){
STORM_LOG_ASSERT(storm::utility::isZero(l),"Upper bound is zero but lower bound is "<<l<<".");
returnu;
}else{
STORM_LOG_ASSERT(!storm::utility::isInfinity(l),"Lower bound is infinity, but upper bound is "<<u<<".");
// If we explore this state and if it has no old behavior, it is clear that an "old" optimal scheduler can be extended to a scheduler that reaches this state
@ -731,9 +749,7 @@ namespace storm {
underApproximation->setCurrentStateIsTruncated();
}elseif(!stateAlreadyExplored){
// Check whether we want to explore the state now!