Web Services: A Process Algebra Approach
Andrea Ferrara
Abstract
It is now well-admitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and verification of WSs using process algebras and their tools. We define a two-way mapping between abstract specifications written using these calculi and executable Web services written in BPEL4WS. Several choices are available: design and correct errors in BPEL4WS, using process algebra verification tools, or design and correct in process algebra and automatically obtaining the corresponding BPEL4WS code. The approaches can be combined. Process algebra are not useful only for temporal logic verification: we remark the use of simulation/bisimulation both for verification and for the hierarchical refinement design method. It is worth noting that our approach allows the use of any process algebra depending on the needs of the user at different levels (expressiveness, existence of reasoning tools, user expertise).
Create a lesson
Related papers
Can Language Models Play the Wikipedia Game?
Alexander Hickey, Joanna Knight, James Bishop
RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics
Weiliang Chen, Song Liao
X-AgentRed: Red-Teaming Personal Agents in Evolving Multi-Service Ecosystems
Yeonsung Jung, Zhiyuan Wang, Zifan Wang et al.
Studying Comics at Scale with Artificial Intelligence: The PAGE Framework and Three Studies of American Comics and Japanese Manga
Emilio Ferrara
UkrMeme: Multimodal Explainable Persuasion Detection in Ukrainian Memes
Nazar Andrushko, Vera Schmitt, Veronika Solopova
A Privileged Teacher That Only Scores Cannot Search: Critique-Conditioned On-Policy Self-Distillation for Reasoning
Mayug Maniparambil, Ayush Rai, Ekansh Verma et al.