找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Web Services and Formal Methods; 5th International Wo Roberto Bruni,Karsten Wolf Conference proceedings 2009 Springer-Verlag Berlin Heidelb

[复制链接]
查看: 23818|回复: 74
发表于 2025-3-21 17:10:02 | 显示全部楼层 |阅读模式
书目名称Web Services and Formal Methods
副标题5th International Wo
编辑Roberto Bruni,Karsten Wolf
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Web Services and Formal Methods; 5th International Wo Roberto Bruni,Karsten Wolf Conference proceedings 2009 Springer-Verlag Berlin Heidelb
描述This book constitutes the thoroughly refereed post-workshop proceedings of the 5th International Workshop on Web Services and Formal Methods, WS-FM 2008, held in Milan, Italy, in September 2008 in conjunction with the 6th International Conference on Business Process Management, BPM 2008. The 13 revised full papers presented together with one invited paper were carefully reviewed and selected from 39 submissions. The papers feature topics such as analysis, test, and verification; choreographies and process calculi; transactions and interoperability; workflows and petri nets.
出版日期Conference proceedings 2009
关键词Web Services; contract complience; event calculus; formal method; message queues; model checking; model-ba
版次1
doihttps://doi.org/10.1007/978-3-642-01364-5
isbn_softcover978-3-642-01363-8
isbn_ebook978-3-642-01364-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2009
The information of publication is updating

书目名称Web Services and Formal Methods影响因子(影响力)




书目名称Web Services and Formal Methods影响因子(影响力)学科排名




书目名称Web Services and Formal Methods网络公开度




书目名称Web Services and Formal Methods网络公开度学科排名




书目名称Web Services and Formal Methods被引频次




书目名称Web Services and Formal Methods被引频次学科排名




书目名称Web Services and Formal Methods年度引用




书目名称Web Services and Formal Methods年度引用学科排名




书目名称Web Services and Formal Methods读者反馈




书目名称Web Services and Formal Methods读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:31:17 | 显示全部楼层
Contract Compliance and Choreography Conformance in the Presence of Message Queues,d theory of contract compliance with choreography specifications à la WS-CDL where activities are interpreted as pairs of send and receive events. An interesting consequence of adopting a language independent representation of contracts is that choreography projection can be defined in structured operational semantics.
发表于 2025-3-22 04:04:34 | 显示全部楼层
RESTful Petri Net Execution,specific class of Petri nets supporting value passing and link passing mobility. Implementation considerations of a prototype are presented. The approach is compared with the traditional BPEL/SOAP approach to process enactment.
发表于 2025-3-22 06:00:52 | 显示全部楼层
RESTful Petri Net Execution,specific class of Petri nets supporting value passing and link passing mobility. Implementation considerations of a prototype are presented. The approach is compared with the traditional BPEL/SOAP approach to process enactment.
发表于 2025-3-22 12:38:46 | 显示全部楼层
发表于 2025-3-22 16:28:13 | 显示全部楼层
Refactoring Long Running Transactions,tial encoding of naive sagas into SC. Secondly, on top of SC, we define a few refactoring transformations for distributed LRT. Finally, we prove that the given refactoring rules are sound by showing that they preserve (weak) bisimilarity.
发表于 2025-3-22 19:37:45 | 显示全部楼层
发表于 2025-3-22 22:56:50 | 显示全部楼层
On the Expressive Power of Process Interruption and Compensation, (Turing Machines can be encoded but only nondeterministically). The calculus with recursion is weakly Turing powerful when extended with interrupt, but it is Turing complete (Turing Machine can be modeled deterministically) when extended with try-catch.
发表于 2025-3-23 01:49:08 | 显示全部楼层
On the Expressive Power of Process Interruption and Compensation, (Turing Machines can be encoded but only nondeterministically). The calculus with recursion is weakly Turing powerful when extended with interrupt, but it is Turing complete (Turing Machine can be modeled deterministically) when extended with try-catch.
发表于 2025-3-23 07:18:11 | 显示全部楼层
Validation and Discovery of Non-deterministic Semantic e-Services,en we characterize the adequacy of an e-service to achieve a user goal as foundational task in service discovery. We present decidable checking procedures for the devised properties using a reduction technique to First-Order Logic reasoning tasks, including an analysis in terms of computational complexity.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 03:03
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表