Generalizing STNU to Model Non-functional Constraints for Business Processes

Due to its ease of use, the notion of Simple Temporal Networks with Uncertainty (STNU) has been successfully used in verifying temporal constraints of business processes. Considering the universality of non-functional attributes, it is significant to generalize STNU in characterizing these non-functional constraints, resulting in a better expressiveness to support process modeling and business applications. In this paper, we leverage STNU to such a level by using abstract algebra on STNU. It results in a general non-functional constraint modeling and verification method in business process management (BPM), from the original temporal constraints to broader qualitative and quantitative ones, which is not yet supported with STNU in the BPM. Based on the proposed method, we demonstrate the capability of verifying dynamic controllability (DC) for these non-functional attributes, such as satisfaction, reputation grade, etc.