From Declarative Model to Solution: Scheduling Scenario Synthesis

TL;DR

This paper introduces a deductive programming approach that transforms declarative scheduling models into solution spaces using program transformations, Petri nets, and reachability trees to generate and analyze scheduling scenarios.

Contribution

It presents a novel method for converting declarative scheduling models into executable solutions through program transformations and Petri net interpretations.

Findings

Generated reachability trees effectively represent solution search spaces.

The approach enables systematic analysis of scheduling scenarios.

Model transformations facilitate solution derivation from declarative specifications.

Abstract

This paper presents deductive programming for scheduling scenario generation. Modeling for solution is achieved through program transformations. First, declarative model for scheduling problem domain is introduced. After that model is interpreted as scheduling domain language and as predicate transition Petri net. Generated reachability tree presents search space with solutions. At the end results are discussed and analyzed.