Paper Info
Title
Planning for declarative processes
Abstract
Recently, declarative process modeling have gained a wide attention from both industry and academia to model loosely-structured processes, mediating between flexibility and support. Instead of describing step by step in an imperative way the set of activities to perform (e.g., Petri-net, UML Activity, BPMN), declarative languages define constraints between the process activities that must not be violated during the execution. Even if these languages allow for a high degree of flexibility, this freedom leads to some understandability problems. Indeed, having a mental representation of the possible process executions becomes too complex for humans as the number of constraints increases on the model. This paper presents a novel and formal approach to automatically synthesize execution plans of declarative processes. At design-time, the plans can increase the understanding and the confidence in the model by providing an early and direct experience with it while being modeled. At run-time, the planning component is primordial to ensure that an execution may still lead to a desired goal by giving the possible execution traces leading to it. A working implementation based on the Alloy model-finding method [10] has been developed. The evaluation of this implementation showed us that plans can be generated efficiently and quickly.
Year
DOI
Venue
2014
10.1145/2554850.2554998
SAC
Keywords
Field
DocType
knowledge representation formalisms and methods,alloy,process model,declarative,project and people management,planning,first-order logic,office automation,first order logic
Programming language,Unified Modeling Language,Computer science,Process modeling,First-order logic,Direct experience,Business Process Model and Notation,Mental representation
Conference
Citations 
PageRank 
References 
1
0.34
21
Authors
4
Name
Order
Citations
PageRank
Yoann Laurent1162.59
Reda Bendraou233426.70
Souheib Baarir33510.01
Marie-Pierre Gervais441339.29