BPMN – A Logical Model and Property Analysis
Journal Title: Decision Making in Manufacturing and Services - Year 2011, Vol 5, Issue 1
Abstract
Business Process Modeling Notation has become a powerful and widely accepted visual language for modeling business processes. Despite its expressive power and high usability, a weak point of BPMN is the lack of formal semantics and difficulties with assuring correctness of the overall process. In this paper an attempt is made towards investigation and development of foundations for a logical, declarative model for BPMN. Such model should enable formal analysis of desired properties referring to correct operation of Business Processes modeled with use of BPMN.
Authors and Affiliations
Antoni Ligęza
Keywords
Related Articles
- EP ID EP165364
- DOI 10.7494/dmms.2011.5.1.57
- Views 221
- Downloads 0
The Effect of Environmental Criteria on Locating a Biorefinery: A Green Facility Location Problem
Underestimating facility location decisions may penalize business performance over the time. Those penalties usually have been studied from the economic point of view analyzing its impact on profitability. Additionally,...
CP-driven Production Process Planning in Multiproject Environment
The way enterprise capabilities are used decides about its competitiveness among other ones. In that context modeling aimed at production tasks allocation planning plays a crucial role especially at concurrently executed...
Analogous Forecasting of Products with a Short Life Cycle
Managing a supply chain for products with a short life cycle, like fashion apparel, high-tech, personal computers, toys, CD’s etc., is challenging for many companies (Fisher and Raman, 1999). Because the life cycles of t...
Scheduling Problems with Learning and Ageing Effects: A Survey
In recent years, many papers concerning scheduling problems with simultaneous learning and ageing effects were published. In this paper, the state of the art of research concerning these problems is presented. In order t...
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual excl...