2008 Sixth European Conference on Web Services最新文献

筛选

英文中文

Dynamic Fault Handling Mechanisms for Service-Oriented Applications 面向服务的应用程序的动态故障处理机制

2008 Sixth European Conference on Web Services Pub Date : 2008-11-12 DOI: 10.1109/ECOWS.2008.20

F. Montesi, C. Guidi, Ivan Lanese, G. Zavattaro

引用次数: 17

Beyond Soundness: On the Semantic Consistency of Executable Process Models 超越健全:论可执行过程模型的语义一致性

2008 Sixth European Conference on Web Services Pub Date : 2008-11-12 DOI: 10.1109/ECOWS.2008.32

I. Weber, J. Hoffmann, J. Mendling

{"title":"Beyond Soundness: On the Semantic Consistency of Executable Process Models","authors":"I. Weber, J. Hoffmann, J. Mendling","doi":"10.1109/ECOWS.2008.32","DOIUrl":"https://doi.org/10.1109/ECOWS.2008.32","url":null,"abstract":"Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these activities. Before deploying such a model, it is important to verify control-flow correctness. A process is sound if its control-flow guarantees proper completion and there are no deadlocks. However, a sound control flow is not sufficient to ensure that an executable process model indeed behaves as expected. This is due to business functions requiring certain preconditions to be fulfilled for execution and having an effect on the process (postconditions). Semantic annotations provide a means for taking such further aspects into account. Inspired by OWL-S and WSMO, we consider process models in which the individual activities are annotated with logical preconditions and postconditions specified relative to an ontology that axiomatizes the underlying business domain. Verification then means to determine whether the interaction of control flow and logical states of the process is correct. To this end, we formalize the semantics of annotated processes and point out which kinds of flaws may arise. We then identify a class of processes with restricted semantic annotations where correctness can be verified in polynomial time; and we prove that the semantic annotations cannot be generalized without losing computational efficiency. The paper is written at a semi-formal level using an illustrative example, details can be looked up in a longer technical report.","PeriodicalId":227761,"journal":{"name":"2008 Sixth European Conference on Web Services","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116107042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

首页上一页