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
A Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies
The paper deals with the problem of optimal configuration of a type of transfer lines which are equipped with transfer machines. Such machines perform operations with standard modular spindle heads which are activated se...
Optimizing Modular Machining Line Design Problem with Mixed Activation Mode of Machining Units
A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints a...
A Utility Function to Solve Approximate Linear Equations for Decision Making
Suppose there are a number of decision variables linearly related to a set of outcome variables. There are at least as many outcome variables as the number of decision variables since all decisions are outcomes by themse...
Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains
This paper discusses mixed integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and d...
Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources
In the paper, we consider a problem of scheduling a set of tasks on a single processor. Each task must be preprocessed before it can be started on a processor. The efficiency of preprocessing is variable, i.e., the rate...