Checking Business Process Evolution

International audienceBusiness processes support the modeling and the implementation of software as workflows of local and inter-process activities. Taking over structuring and composition, evolution has become a central concern in software development. We advocate it should be taken into account as soon as the modeling of business processes, which can thereafter be made executable using process engines or model-to-code transformations. We show here that business process evolution needs formal analysis in order to compare different versions of processes, identify precisely the differences between them, and ensure the desired consistency. To reach this objective, we first present a model transformation from the BPMN standard notation to the LNT process algebra. We then propose a set of relations for comparing business processes at the formal model level. With reference to related work, we propose a richer set of comparison primitives supporting renaming, refinement, property- and context-awareness. Thanks to an implementation of our approach that can be used through a Web application, we put the checking of evolution within the reach of business process designers

Checking Business Process Evolution

A business process is a collection of structured activities producing a particular product or software. BPMN is a workflow-based graphical notation for specifying business processes. Formally analyzing such processes is a crucial challenge in order to avoid erroneous executions of the corresponding software. In this paper, we focus on timed business processes where execution time can be associated to several BPMN constructs. We propose an encoding of timed business processes into the Maude language, which allows one to automatically verify several properties of interest on processes such as the maximum/minimum/average execution time or the timed degree of parallelism that provides a valuable guide for the problem of resource allocation. The analysis is achieved using the rewriting-based tools available in Maude, which also provides other techniques (e.g., reachability analysis and model checking) for verifying BPMN specifications. We applied our approach on a large set of BPMN processes for evaluation purposes.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

IUPC: Identification and Unification of Process Constraints

Business Process Compliance (BPC) has gained significant momentum in research and practice during the last years. Although many approaches address BPC, they mostly assume the existence of some kind of unified base of process constraints and focus on their verification over the business processes. However, it remains unclear how such an inte- grated process constraint base can be built up, even though this con- stitutes the essential prerequisite for all further compliance checks. In addition, the heterogeneity of process constraints has been neglected so far. Without identification and separation of process constraints from domain rules as well as unification of process constraints, the success- ful IT support of BPC will not be possible. In this technical report we introduce a unified representation framework that enables the identifica- tion of process constraints from domain rules and their later unification within a process constraint base. Separating process constraints from domain rules can lead to significant reduction of compliance checking effort. Unification enables consistency checks and optimizations as well as maintenance and evolution of the constraint base on the other side.Comment: 13 pages, 4 figures, technical repor

Making PayPal Pay: Regulation E and Its Application to Alternative Payment Services

In light of the growth of data breaches in both occurrence and scale, it is more important than ever for consumers to be aware of the protections afforded to them under the law regarding electronic fund transfers and alternative payment services. Additionally, it is important that agencies like the Consumer Financial Protection Bureau (“CFPB”), charged with the protection of unsuspecting and often defenseless consumers, are carefully monitoring these protections to ensure they keep pace with the technological evolution of the payment services they regulate. Alternative payment services, such as PayPal, are conducting an enormous number of payments and providing an extremely beneficial service in the era of e-commerce. This Issue Brief argues that, as currently written, the Electronic Fund Transfer Act, implemented by Regulation E, does not adequately protect consumers using these alternative payment services. Regulation E is insufficiently specific and provides circular language in its key definitions, including those for the terms “financial institution” and “account.” These deficiencies could leave consumers engaged with alternative payment services in the unique position of facing unlimited liability for losses resulting from unauthorized electronic fund transfers from their alternative payment service account. Thus, this Issue Brief argues that in order to ensure that Regulation E is written broadly enough to apply to all the functions of PayPal, the CFPB should clarify its language

Refinement for Ontology Evolution in Virtual Enterprises

Virtual enterprise is based on the premise that work should be done where it can be done most optimally. In virtual enterprises, geographical boundaries merge seamlessly. It enables organisations to act in a way of flexibility and ability to adapt to rapid changes on the fly. However, different parties in a virtual enterprise must understand each other before they go further details in business. Ontologies are such kinds of ideal baselines to assist parties to communicate. One of the essential research issues with ontology is how to deal with changes during their evolving cycle. Therefore, ontology refinement is a crucial component in ontology evolution. This paper presents a taxonomy structure focusing on the is-a relations. In particular, the concept of closeness measurement is introduced based on the “distance” estimation. An extended cluster analysis process is provided. According to the algorithm presented, a new concept is generated according to its attributes. Additionally, the refinement mechanisms for primitive operations are proposed. Unlike some other ontology refinement mechanisms which leave ontology consistency checking to human users after modification, our method emphasises the importance of consistency checking by applying description logics which is demonstrated based on the proposed ontology

Conformance Checking Based on Multi-Perspective Declarative Process Models

Process mining is a family of techniques that aim at analyzing business process execution data recorded in event logs. Conformance checking is a branch of this discipline embracing approaches for verifying whether the behavior of a process, as recorded in a log, is in line with some expected behaviors provided in the form of a process model. The majority of these approaches require the input process model to be procedural (e.g., a Petri net). However, in turbulent environments, characterized by high variability, the process behavior is less stable and predictable. In these environments, procedural process models are less suitable to describe a business process. Declarative specifications, working in an open world assumption, allow the modeler to express several possible execution paths as a compact set of constraints. Any process execution that does not contradict these constraints is allowed. One of the open challenges in the context of conformance checking with declarative models is the capability of supporting multi-perspective specifications. In this paper, we close this gap by providing a framework for conformance checking based on MP-Declare, a multi-perspective version of the declarative process modeling language Declare. The approach has been implemented in the process mining tool ProM and has been experimented in three real life case studies