The Control Function Recovery Problem (CFRP) is a combinatorial assignment problem that arises in the automated reconstruction of signal wiring in industrial closed-loop control systems. Given an observed (scrambled) port configuration s and the multiplicity vector m encoding the functional class structure, the task is to find a permutation π that restores every port to a class-compatible position.
This page provides an archive of the 54-instance benchmark suite used in the paper and will be extended with formal problem description and a self-contained instance generator after publication.
Each instance file contains five lines:
# CFRP instance n=24 k=3 sigma=U suite_seed=1764 logD=-22.970921 # pi* = [10 18 1 7 13 15 3 17 20 8 22 16 21 0 19 5 9 23 4 14 12 11 2 6] 8 8 8 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 1 2 0 0 1 1 0 2 2 1 2 2 2 0 2 0 1 2 0 1 1 1 0 0
| Line | Content |
|---|---|
| 1 | Parameters: n, k, σ, suite seed, log D |
| 2 | Scrambling permutation π* (ground truth) |
| 3 | Multiplicity vector m |
| 4 | Target configuration t |
| 5 | Observed configuration s |