You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 

226 lines
9.7 KiB

#include "storm/storage/jani/TemplateEdge.h"
#include "storm/storage/jani/Model.h"
#include "storm/storage/jani/LValue.h"
#include "storm/storage/expressions/LinearityCheckVisitor.h"
#include "storm/storage/jani/expressions/JaniExpressionSubstitutionVisitor.h"
namespace storm {
namespace jani {
TemplateEdge::TemplateEdge(storm::expressions::Expression const& guard) : guard(guard), lowestAssignmentLevel(std::numeric_limits<uint64_t>::max()), highestAssignmentLevel(0) {
// Intentionally left empty.
}
TemplateEdge::TemplateEdge(storm::expressions::Expression const& guard, OrderedAssignments const& assignments, std::vector<TemplateEdgeDestination> const& destinations)
: guard(guard), destinations(destinations), assignments(assignments), lowestAssignmentLevel(std::numeric_limits<uint64_t>::max()), highestAssignmentLevel(0) {
// Intentionally left empty.
}
void TemplateEdge::addDestination(TemplateEdgeDestination const& destination) {
destinations.emplace_back(destination);
}
bool TemplateEdge::addTransientAssignment(Assignment const& assignment, bool addToExisting) {
return assignments.add(assignment, addToExisting);
}
void TemplateEdge::finalize(Model const& containingModel) {
if (assignments.empty()) {
lowestAssignmentLevel = std::numeric_limits<uint64_t>::max();
highestAssignmentLevel = 0;
} else {
lowestAssignmentLevel = assignments.getLowestLevel();
highestAssignmentLevel = assignments.getHighestLevel();
}
for (auto const& destination : getDestinations()) {
if (!destination.getOrderedAssignments().empty()) {
lowestAssignmentLevel = std::min<uint64_t>(lowestAssignmentLevel, destination.getOrderedAssignments().getLowestLevel());
highestAssignmentLevel = std::max<uint64_t>(highestAssignmentLevel, destination.getOrderedAssignments().getHighestLevel());
}
for (auto const& assignment : destination.getOrderedAssignments().getAllAssignments()) {
Variable const& var = assignment.getLValue().isVariable() ? assignment.getLValue().getVariable() : assignment.getLValue().getArray();
if (containingModel.getGlobalVariables().hasVariable(var.getExpressionVariable())) {
writtenGlobalVariables.insert(var.getExpressionVariable());
}
}
}
}
boost::container::flat_set<storm::expressions::Variable> const& TemplateEdge::getWrittenGlobalVariables() const {
return writtenGlobalVariables;
}
storm::expressions::Expression const& TemplateEdge::getGuard() const {
return guard;
}
void TemplateEdge::setGuard(storm::expressions::Expression const& newGuard) {
guard = newGuard;
}
std::size_t TemplateEdge::getNumberOfDestinations() const {
return destinations.size();
}
std::vector<TemplateEdgeDestination> const& TemplateEdge::getDestinations() const {
return destinations;
}
std::vector<TemplateEdgeDestination>& TemplateEdge::getDestinations() {
return destinations;
}
TemplateEdgeDestination const& TemplateEdge::getDestination(uint64_t index) const {
return destinations[index];
}
OrderedAssignments const& TemplateEdge::getAssignments() const {
return assignments;
}
OrderedAssignments& TemplateEdge::getAssignments() {
return assignments;
}
void TemplateEdge::substitute(std::map<storm::expressions::Variable, storm::expressions::Expression> const& substitution) {
guard = substituteJaniExpression(guard, substitution);
for (auto& assignment : assignments) {
assignment.substitute(substitution);
}
for (auto& destination : destinations) {
destination.substitute(substitution);
}
}
void TemplateEdge::changeAssignmentVariables(std::map<Variable const*, std::reference_wrapper<Variable const>> const& remapping) {
for (auto& destination : destinations) {
destination.changeAssignmentVariables(remapping);
}
assignments.changeAssignmentVariables(remapping);
}
void TemplateEdge::liftTransientDestinationAssignments(uint64_t maxLevel) {
if (!destinations.empty()) {
auto const& destination = *destinations.begin();
std::vector<std::shared_ptr<Assignment>> assignmentsToLift;
for (auto const& assignment : destination.getOrderedAssignments().getTransientAssignments()) {
// Check if we can lift the assignment to the edge.
bool canBeLifted = assignment.getLevel() <= maxLevel;
if (canBeLifted) {
for (auto const& destination : destinations) {
if (!destination.hasAssignment(assignment)) {
canBeLifted = false;
break;
}
}
}
if (canBeLifted) {
// Do not remove the assignment now, as we currently iterate over them.
// Also we need to make a copy of the assignment since we are about to delete it
assignmentsToLift.push_back(std::make_shared<Assignment>(assignment));
}
}
// now actually lift the assignments
for (auto const& assignment : assignmentsToLift) {
this->addTransientAssignment(*assignment);
for (auto& destination : destinations) {
destination.removeAssignment(*assignment);
}
}
}
}
void TemplateEdge::pushAssignmentsToDestinations() {
STORM_LOG_ASSERT(!destinations.empty(), "Need non-empty destinations for this transformation.");
for (auto const& assignment : this->getAssignments()) {
for (auto& destination : destinations) {
destination.addAssignment(assignment, true);
}
}
this->assignments.clear();
}
bool TemplateEdge::usesVariablesInNonTransientAssignments(std::set<storm::expressions::Variable> const& variables) const {
for (auto const& destination : destinations) {
for (auto const& assignment : destination.getOrderedAssignments().getNonTransientAssignments()) {
if (assignment.getAssignedExpression().containsVariable(variables)) {
return true;
}
}
}
return false;
}
bool TemplateEdge::hasTransientEdgeDestinationAssignments() const {
for (auto const& destination : this->getDestinations()) {
if (destination.hasTransientAssignment()) {
return true;
}
}
return false;
}
bool TemplateEdge::usesAssignmentLevels(bool onlyTransient) const {
if (assignments.hasMultipleLevels(onlyTransient)) {
return true;
}
for (auto const& destination : this->getDestinations()) {
if (destination.usesAssignmentLevels(onlyTransient)) {
return true;
}
}
return false;
}
uint64_t const& TemplateEdge::getLowestAssignmentLevel() const {
return lowestAssignmentLevel;
}
uint64_t const& TemplateEdge::getHighestAssignmentLevel() const {
return highestAssignmentLevel;
}
bool TemplateEdge::hasEdgeDestinationAssignments() const {
for (auto const& destination : destinations) {
if (destination.hasAssignments()) {
return true;
}
}
return false;
}
bool TemplateEdge::isLinear() const {
storm::expressions::LinearityCheckVisitor linearityChecker;
bool result = linearityChecker.check(this->getGuard(), true);
for (auto const& destination : destinations) {
result &= destination.isLinear();
}
return result;
}
TemplateEdge TemplateEdge::simplifyIndexedAssignments(bool syncronized, VariableSet const& localVars) const {
// We currently only support cases where we have EITHER edge assignments or destination assignments.
if (assignments.empty()) {
// Only edge destination assignments:
TemplateEdge simplifiedTemplateEdge(guard);
for(auto const& dest : destinations) {
simplifiedTemplateEdge.addDestination(dest.simplifyIndexedAssignments(syncronized, localVars));
}
return simplifiedTemplateEdge;
} else if(!hasEdgeDestinationAssignments()) {
return TemplateEdge(guard, assignments.simplifyLevels(syncronized, localVars), destinations);
} else {
return TemplateEdge(*this);
}
}
}
}