  In this work we propose a new approach for semantic web matching to improve
the performance of Web Service replacement. Because in automatic systems we
should ensure the self-healing, self-configuration, self-optimization and
self-management, all services should be always available and if one of them
crashes, it should be replaced with the most similar one. Candidate services
are advertised in Universal Description, Discovery and Integration (UDDI) all
in Web Ontology Language (OWL). By the help of bipartite graph, we did the
matching between the crashed service and a Candidate one. Then we chose the
best service, which had the maximum rate of matching. In fact we compare two
services` functionalities and capabilities to see how much they match. We found
that the best way for matching two web services, is comparing the
functionalities of them.
