Dear WSC08 participants, Here we present the score calculation for the Web Service Challenge 2008. I cannot guarantee that we wont change or adjust the calculation until the conference but the overall metrics defined here wont change. The BPEL checking software will evaluate the results of the participant's composition system. We will measure the minimum amount of services in the BPEL file for a solution path, its correctness regarding the challenge task and also check the execution length of the solution path. I am especially sorry that we cannot reward composition systems which are able to find all or most of all possible solutions in a challenge set. We were not able to finish a checking software that can not only check solution correctness but also recognize redundant services inside solutions and duplicate solution paths. 1.) We will provide 4 challenge sets and each composition system can achieve up to 18 points and no less than 0 points per challenge set. Three challenge sets will have at least one feasible solution and one challenge set will have no solution at all. 2.) The time limit for solving a challenge is 20 minutes. Every composition system replying with a solution later than 20 minutes will receive 0 points for the challenge set. Otherwise we would not be able to finish the challenge with a feasible schedule. 3.) The task is to find the minimum set of services which solves the challenge of the challenge set. Additionally the composition systems which also finds the minimum execution depth and the ones solving the challenge set in the fastest time will be rewarded. Score per challenge set: ------------------------ +6 Points for finding the minimum set of services that solves the challenge. +6 Points for finding the minimum execution length that solves the challenge. +6 Points for the composition system which finds the the minimum set of services that solves the challenge in the fastest time. +4 Points for the composition system which finds the the minimum set of services that solves the challenge in the second fastest time. +2 Points for the composition system which finds the the minimum set of services that solves the challenge in the third fastest time. Score for the non solveable challenge set: ------------------------------------------ +6 Point for the composition system which first recognizes that the challenge set is not solveable. +4 Point for the composition system which first recognizes that the challenge set is not solveable. +2 Point for the composition system which first recognizes that the challenge set is not solveable. Example output of our solution checker: All proposed BPEL processes can be executed. All proposed BPEL processes provide all wanted output parameters. All proposed BPEL processes are correct solutions for the challenge. 168492 execution sequences that solve the challenge were found in total. The shortest execution sequence that solves the challenge found is 2. The execution sequence involving the least number of services for solving the challenge found consists of 3 services. There are 1 redundant services. Best regards, Steffen Bleul