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 条
  • [21] Sequential and concurrent abstract machines for interaction nets
    Pinto, JS
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 2000, 1784 : 267 - 282
  • [22] Communication in Abstract State Machines
    Boerger, Egon
    Schewe, Klaus-Dieter
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2017, 23 (02) : 129 - 145
  • [23] Slicing abstract state machines
    Nowack, A
    ABSTRACT STATE MACHINES 2004: ADVANCES IN THEORY AND PRACTICE, PROCEEDINGS, 2004, 3052 : 186 - 201
  • [24] ABSTRACT STATE MACHINES AND THEIR APPLICATIONS
    Reyes Vera, Javier Mauricio
    REVISTA EDUCACION EN INGENIERIA, 2012, 7 (13): : 55 - 62
  • [25] Research of workflow modeling based on concurrent transaction logic
    Feng, Zhilin
    Yin, Jianwei
    He, Zhaoyang
    2006 10TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, PROCEEDINGS, VOLS 1 AND 2, 2006, : 1235 - 1238
  • [26] Denotational semantics using horn concurrent transaction logic
    Santos, MV
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 431 - 432
  • [27] Using Symbolic Execution to Transform Turbo Abstract State Machines into Basic Abstract State Machines
    Del Castillo, Giuseppe
    RIGOROUS STATE-BASED METHODS, ABZ 2024, 2024, 14759 : 215 - 222
  • [28] TIMED CONCURRENT STATE MACHINES
    Daszczuk, Wiktor B.
    COMPUTER SCIENCE-AGH, 2007, 8 : 23 - 36
  • [29] State enumeration with abstract descriptions of state machines
    Corella, F
    Langevin, M
    Cerny, E
    Zhou, Z
    Song, X
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, 1995, 987 : 146 - 160
  • [30] Abstract state machines: Designing distributed systems with state machines and B
    Stoddart, B
    Dunne, S
    Galloway, A
    Shore, R
    B'98: RECENT ADVANCES IN THE DEVELOPMENT AND USE OF THE B METHOD, 1998, 1393 : 226 - 242