Preferential refinements of absteact state machines for service mediators

Klaus Dieter Schewe*, Qing Wang

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Citation (Scopus)

    Abstract

    Large-scale service-oriented computing is based on the idea that services from various servers are combined into one distributed application. For this the notion of service mediator has been coined, which captures specifications of composed services with slots that have to be filled by actual services. Such mediators can be specified by expressions in Kleene algebras with tests (KATs) or equivalently by very restricted Abstract State Machines (ASMs). In this paper we address the refinement of such specifications with the intention to capture more meaningful conditions on the service slots and to fine-tune the matching of the slots with actual services. In particular, we investigate refinements that express user preferences thus leading to personalised mediators. For this form of adaptivity a previously developed term rewriting approach on KATs is generalised to refinements on ASMs.

    Original languageEnglish
    Title of host publicationProceedings - 12th International Conference on Quality Software, QSIC 2012
    Pages158-166
    Number of pages9
    DOIs
    Publication statusPublished - 2012
    Event12th International Conference on Quality Software, QSIC 2012 - Xi'an, Shaanxi, China
    Duration: 27 Aug 201229 Aug 2012

    Publication series

    NameProceedings - International Conference on Quality Software
    ISSN (Print)1550-6002

    Conference

    Conference12th International Conference on Quality Software, QSIC 2012
    Country/TerritoryChina
    CityXi'an, Shaanxi
    Period27/08/1229/08/12

    Fingerprint

    Dive into the research topics of 'Preferential refinements of absteact state machines for service mediators'. Together they form a unique fingerprint.

    Cite this