Model Checking of Constraint-Based Workflow Based on Linear Temporal Logic
Keyword(s):
The degree of flexibility of workflow management systems heavily influences the way business processes are executed. Constraint-based models are considered to be more flexible than traditional models because of their semantics: everything that does not violate constraints is allowed. More and more people use declarative languages to define workflow, such as linear temporal logic. But how to guarantee the correctness of the model based on the linear temporal logic is still a problem. This article proposes a way to verify the model based on Büchi automaton and gives the corresponding algorithms. Thus the verification of declarative workflow based on the linear temporal logic is solved.
2015 ◽
Vol 3
(1)
◽
pp. 4-20
2010 ◽
Vol 439-440
◽
pp. 599-604
2009 ◽
Vol 18
(03n04)
◽
pp. 481-512
◽
2010 ◽
Vol 426-427
◽
pp. 343-347
2010 ◽
Vol 7
(3)
◽
pp. 489-509
◽
2002 ◽
Vol 12
(04)
◽
pp. 331-361
◽