DocumentCode :
2605165
Title :
Model checking of workflow schemas
Author :
Karamanolis, C. ; Giannakopoulou, D. ; Magee, J. ; Wheater, S.M.
fYear :
2000
fDate :
2000
Firstpage :
170
Lastpage :
179
Abstract :
Practical experience indicates that the definition of real-world workflow applications is a complex and error-prone process. Existing workflow management systems provide the means, in the best case, for very primitive syntactic verification, which is not enough to guarantee the overall correctness and robustness of workflow applications. The paper presents an approach for formal verification of workflow schemas (definitions). Workflow behaviour is modelled by means of an automata-based method, which facilitates exhaustive compositional reachability analysis. The workflow behaviour can then be analysed and checked for safety and liveness properties. The model generation and the analysis procedure are governed by well-defined rules that can be fully automated. Therefore, the approach is accessible by designers who are not experts in formal methods
Keywords :
formal verification; reachability analysis; workflow management software; automata-based method; compositional reachability analysis; correctness; error-prone process; formal methods; formal verification; liveness properties; model checking; primitive syntactic verification; robustness; workflow schemas; Automatic control; Business; Control systems; Costs; Educational institutions; Formal verification; Reachability analysis; Robustness; Safety; Workflow management software;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Enterprise Distributed Object Computing Conference, 2000. EDOC 2000. Proceedings. Fourth International
Conference_Location :
Makuhari
Print_ISBN :
0-7695-0865-0
Type :
conf
DOI :
10.1109/EDOC.2000.882357
Filename :
882357
Link To Document :
بازگشت