1-2hit |
Jaeyong SHIM Minkyu LEE Dongsoo HAN
A workflow definition containing errors might cause serious problems for an enterprise especially when it involves mission critical business processes or inter-organizational interaction. So workflow definitions should be defined in a strict and rigorous way. In this paper, we develop a workflow definition language and analysis methods for the language to support strict and rigorous workflow definitions. Faults or mistakes causing communication deadlock, access conflicts, and improper exception specification in workflow definitions can be detected and notified automatically using the methods. The proposed workflow definition language borrows structured constructs of conventional programming languages because many good features of conventional programming languages also can be used effectively in expressing workflow processes. With slight modifications and scope restrictions, the developed analysis techniques in this paper can be used in any workflow definition languages and they can help workflow designers define workflow processes in much more safe and reliable manner.
Chuan-Chieh JUNG Tze-Heng MA Yue-Sun KUO
Constraints have been used extensively for the construction of graphical user interfaces. User interface constraints that are declarative are more favorable but require sophisticated constraint planning algorithms. Constraint planning algorithms proposed previously are getting more and more complicated as they were asked to handle more general requirements. We believe that the difficulty is mainly caused by the complicated data structure that is translated directly from the problem. By a transformation, we propose a simplified graph model for the problem and prove that the constraint planning problem can be reduced to finding feedback vertex sets on the simplified graph model. We also consider the general problem of handling non-uniform user interface constraints.