| Skip to main content | Skip to navigation |

Automatic Matchmaking of Web Services

  • Sudhir Agarwal, AIFB, University of Karlsruhe, Germany
  • Anupriya Ankolekar, AIFB, University of Karlsruhe, Germany

Full text:

Track: Posters

Web services are meant for achieving automation in the interoperability across organizational boundaries. To achieve this goal, it is necessary that machines can reason over the meaning of the business processes and that of the data that is exchanged among the business processes. We propose a novel combination of pi-calculus and DLs for describing not only static semantic constraints but also the access control policies and behavior of a web service semantically. Further, we have developed a matchmaking algorithm that considers semantic, security and behavioral properties of web services. Our matchmaking algorithm not only returns match/no-match answers but in case of a match a set of conditions under which a web service offers the desired functionality.

Other items being presented by these speakers

Organised by

ECS Logo

in association with

BCS Logo ACM Logo

Platinum Sponsors

Sponsor of The CIO Dinner

Valid XHTML 1.0! IFIP logo WWW Conference Committee logo Web Consortium logo Valid CSS!