| | 644 | |
| | 645 | <tr id="6128043" class="entry"> |
| | 646 | <td>Feng, Y., Veeramani, A., Kanagasabai, R. & Rho, S. </td> |
| | 647 | <td>Automatic Service Composition via Model Checking <p class="infolinks">[<a href="javascript:toggleInfo('6128043','abstract')">Abstract</a>] [<a href="javascript:toggleInfo('6128043','bibtex')">BibTeX</a>]</p></td> |
| | 648 | <td>2011</td> |
| | 649 | <td>Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific, pp. 477 -482 </td> |
| | 650 | <td>inproceedings</td> |
| | 651 | <td><a href="http://dx.doi.org/10.1109/APSCC.2011.54">DOI</a> </td> |
| | 652 | </tr> |
| | 653 | <tr id="abs_6128043" class="abstract noshow"> |
| | 654 | <td colspan="7"><b>Abstract</b>: Web service composition is the process of constructing a set of Web services which, when invoked with some user input in a particular order, can produce the output to the user's requirements. This paper proposes a novel model checking based approach for automated service composition. Modeling services as a set of interleaved processes in a class of process algebra, we formulate service composition as model checking asserted on a specific type of property on the model. We show that, under this formulation, correct composition workflows can be constructed from the counter-examples provided by model checking. With a case study on online hotel booking services, we demonstrate that the proposed approach can support directed a cyclic composition graphs and the generated composition graphs are automatically verified.</td> |
| | 655 | </tr> |
| | 656 | <tr id="bib_6128043" class="bibtex noshow"> |
| | 657 | <td colspan="7"><b>BibTeX</b>: |
| | 658 | <pre> |
| | 659 | @inproceedings{6128043, |
| | 660 | author = {Yuzhang Feng and Veeramani, A. and Kanagasabai, R. and Seungmin Rho}, |
| | 661 | title = {Automatic Service Composition via Model Checking}, |
| | 662 | booktitle = {Services Computing Conference (APSCC), 2011 IEEE Asia-Pacific}, |
| | 663 | year = {2011}, |
| | 664 | pages = {477 -482}, |
| | 665 | doi = {http://dx.doi.org/10.1109/APSCC.2011.54} |
| | 666 | } |
| | 667 | </pre></td> |
| | 668 | </tr> |
| | 669 | |
| | 670 | |