Specifying and Monitoring Temporal Properties in Web Services Compositions

A Survey on Time-aware Business Process Modeling

“…Indedeed, the visual appeal of the graph-based modeling approaches makes them useful for all kinds of workflow designers since no technical background is required. Similarly, other research efforts (Makni et al, 2010;Makni et al, 2011;Kallel et al, 2009;Guermouche, 2010;Du et al, 2011;Huai et al, 2010) opted for formal specification languages with modeling capabilities such as Petri nets and Timed Automata. Whereas, other approaches like (Wong and Gibbons, 2009) opted for CSP as a process algebra language, which lacks for graphical support.…”

“…When dealing with temporal constraints, we remarked the lack of absolute time constraints in the majority of the works. In addition to that, just one work has modeled time points obtained from the execution phase (Kallel et al, 2009). We propose to deal with sequence, choice and concurrency structures and thus adopting best and worst cases of execution.…”

“…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)…”

“…The approach proposed in (Kallel et al, 2009) covers the specification of temporal constraints for the web service domain using a new proposed language, XTUS-Automata. In the specification phase, this work presents temporal specification patterns ( i.e.…”

Overview of Time Issues with Temporal Logics for Business Process Models

“…It includes checking if a process choreography fulfils the declared time requirements and is based on Business Process Execution Language models which are then interpreted in the Fiacre formal verification language. Another method used to verify temporal constrains is based on new formal language, XTUS-Automata, which can be used to specify both relative and absolute time properties and also include deadlock verification [53]. This solution use temporal specification patterns, which are provided for different types of properties.…”