Workflow management systems (WfMSs) frequently use data to coordinate the execution of workflow instances. A WfMS evaluates conditions defined on data to make the control flow decisions i.e. selecting the next activity or deciding on an actor. However, data within and outside of a running workflow instance may change dynamically. Modifications of data needed for past control flow decisions may ...

CONFLICT OF INTEREST NONE DECLARED. INTRODUCTION Through psychological support for prison guard's awareness about professional stress and burn-out, cognitive assessment of stress consequences, insight in coping strategies, as well as prevention of stress consequences is achieved. AIM Evaluation of psychoeducation effects on professional stress consequences within prison guards. METHOD In ...

We define and study the following two-player game on a graph G. Let k ∈ N∗. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy may move along at most s edges, where s ∈ N∗ is his speed. Then, each guard may move along one edge. The spy and the guards may occupy the same vertices. The spy has to escape the surveillance of the gua...

We use mobile guards on the vertices of a graph to defend it against an infinite sequence of attacks on its edges. A guard on an incident vertex moves across the attacked edge to defend it; other guards may also move to neighboring vertices. We prove upper and lower bounds on the minimum number of guards needed for this eternal vertex cover problem and characterize the graphs for which the uppe...

We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the guards must move along the boundary of the room and eventually meet again. We give polynomial time algorithms for finding a search schedule that minimizes the total distance travelled by the guards and for minimizing the...