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

Sinuate

書目名稱Web Services and Formal Methods影響因子(影響力)




書目名稱Web Services and Formal Methods影響因子(影響力)學(xué)科排名




書目名稱Web Services and Formal Methods網(wǎng)絡(luò)公開度




書目名稱Web Services and Formal Methods網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Web Services and Formal Methods被引頻次




書目名稱Web Services and Formal Methods被引頻次學(xué)科排名




書目名稱Web Services and Formal Methods年度引用




書目名稱Web Services and Formal Methods年度引用學(xué)科排名




書目名稱Web Services and Formal Methods讀者反饋




書目名稱Web Services and Formal Methods讀者反饋學(xué)科排名

GORGE

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.

stratum-corneum

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.

前奏曲

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.

雇傭兵

一夫一妻制

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.

Exterior

JEER

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.

MEN

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.

侵略主義

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.