Use of constraints in Petri nets for modelling and solving scheduling problems in preliminary system design

In preliminary system design, scheduling problems are stated with uncertain parameters in order to provide some flexibility to implementation teams. In the paper, the joint use of Petri nets and constraint logic programming paradigms is studied to model and solve job shop scheduling problems, taking into account this uncertainty. The proposed modelling tool is called constrained predicate nets, an extension of predicate/transition nets that formally handles constraints in tokens.