WSMO choreography: From Abstract State Machines to Concurrent Transaction Logic

被引:0
|
作者
Roman, Dumitru [1 ]
Kifer, Michael [2 ]
Fensel, Dieter [1 ]
机构
[1] STI Innsbruck, Innsbruck, Austria
[2] SUNY Stony Brook, Stony Brook, NY USA
来源
SEMANTIC WEB: RESEARCH AND APPLICATIONS, PROCEEDINGS | 2008年 / 5021卷
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Several approaches to semantic Web services, including OWLS, SWSF, and WSMO, have been proposed in the literature with the aim to enable automation of various tasks related to Web services, including discovery, contracting, enactment, monitoring, and mediation. The ability to specify processes and to reason about them is central to these initiatives. In this paper we analyze the WSMO choreography model, which is based on Abstract State Machines (ASMs), and propose a methodology for generating WSMO choreography from visual specifications. We point out the limitations of the current WSMO model and propose a faithful extension that is based on Concurrent Transaction Logic (CTR). The advantage of a CTR-based model is that it uniformly captures a number of aspects that previously required separate mechanisms or were not captured at all. These include process specification, contracting for services, service enactment, and reasoning.
引用
收藏
页码:659 / +
页数:3
相关论文
共 50 条
  • [1] Web service choreography model based on concurrent transaction logic
    Wang, Yong
    Jiang, Zheng-Tao
    Hou, Ya-Rong
    Fang, Juan
    Mao, Guo-Jun
    Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2009, 35 (08): : 1132 - 1137
  • [2] Concurrent abstract state machines
    Borger, Egon
    Schewe, Klaus-Dieter
    ACTA INFORMATICA, 2016, 53 (05) : 469 - 492
  • [3] Concurrent abstract state machines
    Egon Börger
    Klaus-Dieter Schewe
    Acta Informatica, 2016, 53 : 469 - 492
  • [4] A logic for Abstract State Machines
    Stärk, RF
    Nanchen, S
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2001, 7 (11): : 980 - 1005
  • [5] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Flavio Ferrarotti
    Klaus-Dieter Schewe
    Loredana Tec
    Qing Wang
    Annals of Mathematics and Artificial Intelligence, 2018, 83 : 321 - 349
  • [6] A unifying logic for non-deterministic, parallel and concurrent abstract state machines
    Ferrarotti, Flavio
    Schewe, Klaus-Dieter
    Tec, Loredana
    Wang, Qing
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2018, 83 (3-4) : 321 - 349
  • [7] Concurrent Reflective Abstract State Machines
    Schewe, Klaus-Dieter
    2017 19TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2017), 2017, : 30 - 35
  • [8] A security logic for abstract state machines
    Nanchen, S
    Stärk, RF
    ABSTRACT STATE MACHINES 2004: ADVANCES IN THEORY AND PRACTICE, PROCEEDINGS, 2004, 3052 : 169 - 185
  • [9] Concurrent Abstract State Machines and +CAL Programs
    Altenhofen, Michael
    Boerger, Egon
    RECENT TRENDS IN ALGEBRAIC DEVELOPMENT TECHNIQUES, 2009, 5486 : 1 - +
  • [10] Generating Finite State Machine from WSMO Choreography for Testing Web Services
    Rusli, Hazlifah Mohd
    Ahmad, Aishah
    Ibrahim, Suhaimi
    Puteh, Mazidah
    2015 TENTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION MANAGEMENT (ICDIM), 2015, : 212 - 217