Controllability in Temporal Conceptual Workflow Schemata

Combi, Carlo; Posenato, Roberto

doi:10.1007/978-3-642-03848-8_6

Cited by 50 publications

(45 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The notion of controllability, extensively studied in the context of scheduling and planning problems over temporal networks [6,7,8,27,31,32], has been considered as a useful concept for supporting decisions in business process management and design [9,21,22].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Verifying Controllability of Time-Aware Business Processes

Angelis

Fioravanti

Meo

et al. 2017

Rules and Reasoning

View full text Add to dashboard Cite

Abstract. We present an operational semantics for time-aware business processes, that is, processes modeling the execution of business activities, whose durations are subject to linear constraints over the integers. We assume that some of the durations are controllable, that is, they can be determined by the organization that enacts the process, while others are uncontrollable, that is, they are determined by the external world.Then, we consider controllability properties, which guarantee the completion of the enactment of the process, satisfying the given duration constraints, independently of the values of the uncontrollable durations. Controllability properties are encoded by quantified reachability formulas, where the reachability predicate is recursively defined by a set of Constrained Horn Clauses (CHCs). These clauses are automatically derived from the operational semantics of the process.Finally, we present two algorithms for solving the so called weak and strong controllability problems. Our algorithms reduce these problems to the verification of a set of quantified integer constraints, which are simpler than the original quantified reachability formulas, and can effectively be handled by state-of-the-art CHC solvers.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Verifying Controllability of Time-Aware Business Processes

Angelis

Fioravanti

Meo

et al. 2017

Rules and Reasoning

View full text Add to dashboard Cite

show abstract

“…Time modeling and management in the clinical workflow domain has been widely investigated by Combi et al (Combi et al, 2007;Combi and Posenato, 2009). Among the proposed temporal constructs, we can notice: the duration (the activity duration) and delays (the edge duration), the relative constraints, the absolute constraints, and the periodic constraints.…”

Section: Temporal Constraints In the Workflow Research Areamentioning

confidence: 99%

“…To this regard, the authors developed a tool named Temporal Workflow Analyzer (TWA) to support workflow modeling at workflow design time. Furthermore, in (Combi and Posenato, 2009), the authors introduced and discussed the concept of controllability checking which refers to the capability of executing a workflow for any possible duration of tasks.…”

Section: Temporal Constraints In the Workflow Research Areamentioning

confidence: 99%

“…the analysis of dead tasks, bottlenecks, deadlocks and loops) (Kallel et al, 2009;Watahiki et al, 2011), there are some works which have tried to differentiate the two verification processes (Guermouche, 2010;Huai et al, 2010;Du et al, 2011). (Huai et al, 2010) Time Petri nets dead task + deadlock +infinite loops the reachability graph of the Petri nets the time conflicts of the model the time choreography verification algorithm (Du et al, 2011) Time workflow nets duration between two activitie Algorithms (TWF-net) less than s time units + UPAAL model checker (Kazhamiakin et al, 2006a) Web Service Timed deadlock model checker NuSMV State Transition Systems (WSTTS) + maximal and minimal duration of the process (Kallel et al, 2009) XTUS-Automata deadlock UPAALmodel checker (Guermouche, 2010) Timed Automata compatibility analysis of the web Algorithms service choreography deadlock UPAAL model checker (Eder and Tahamtan, 2008b) Timed activity graphs Temporal consistency Algorithms (Eder and Tahamtan, 2008a) + Time conformance (Makni et al, 2010) Time Petri nets Time conformance TINA model checker and LPT (Makni et al, 2011) (Guermouche andZilio, 2012) A modeling environment the absence constraint with delay inspired from BPMN + the response constraint with delay TINA model checker The Fiacre specification (Bettini et al, 2002) Temporal Constraint with Granularity the consistency Algorithms (TCG) graph (Combi et al, 2007) A proposed conceptual The controllability checking Algorithms (Combi and Posenato, 2009) workflow model (Wong and Gibbons, 2009) Communicating Sequential Time compatibility FDR model checker Processes (CSP)…”

Section: How This Verification Is Proceeded?mentioning

confidence: 99%

“…Additionally, there are some efforts concentrating on verifying other issues such as time conformance (Eder and Tahamtan, 2008a;Makni et al, 2010), the absence constraint (Guermouche and Zilio, 2012), and controllability (Combi and Posenato, 2009).…”

Section: How This Verification Is Proceeded?mentioning

confidence: 99%

See 2 more Smart Citations

A Survey on Time-aware Business Process Modeling

2013

Proceedings of the 15th International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

Abstract:One key perspective when dealing with Business Process Management (BPM) is time. All business experts agree upon the fact that time is a key resource for each business process within an organisation. Indeed, time managing is an effective cost and error reduction strategy and thus ensures profit maximization for the organisation. As a result, business managers, researchers, and academicians in management are striving to have full-support of temporal aspects in business process management suites. Consequently, modeling and managing temporal requirements in the business process field is becoming a topic of intensive research. This paper presents a survey of the existing approaches to specifying and verifying the temporal perspective in business processes.

show abstract