Service Discovery with Cost Thresholds

Synthesizing Cost-Minimal Partners for Services

“…In previous work [8], we have shown that k-cost-bounded controllability is decidable. Then, by Theorem 1, cost-bounded controllability is decidable as well.…”

“…We formally model services as weighted nets [8]: A weighted net is a Petri net [9], modeling the behavioral aspects, augmented with a cost function, modeling the non-functional aspects. We omit a formal description of weighted net syntax and semantics, but informally introduce the core concepts by means of examples.…”

“…If mb(N ) is known, synthesizing a cost-minimal partner either reduces to synthesizing an arbitrary partner (if mb(N ) is infinite) or a k-cost bounded partner for k = mb(N ) (if mb(N ) is finite). Both problems are solvable: The synthesis of an arbitrary partner is decribed in [7]; for k = mb(N ) the synthesis of an k-cost-bounded partner may be solved by applying the synthesis procedure in [8]. We sketch our computation strategy for mb(N ).…”

“…First, we decide cost-bounded controllability. In order to decide cost-bounded controllability, we reduce cost-bounded controllability to the decidable problem of k-cost bounded controllability [8].…”

“…As sketched above, requirements and preferences may be defined on different levels [6], such as syntax, behavior and non-functional properties. There exist solutions for partner synthesis for selected behavioral [7] and non-functional requirements [8].…”