A distributed server architecture supporting dynamic resource provisioning for BPM-oriented workflow management systems

Workflow management systems have been widely used in many business process management (BPM) applications. There are also a lot of companies offering commercial software solutions for BPM. However, most of them adopt a simple client/server architecture with one single centralized workflow-management server only. As the number of incoming workflow requests increases, the single workflow-management server might become the performance bottleneck, leading to unacceptable response time. Development of parallel servers might be a possible solution. However, a parallel server architecture with a fixed-number of servers cannot efficiently utilize computing resources under time-varying system workloads. This paper presents a distributed workflow-management server architecture which adopts dynamic resource provisioning mechanisms to deal with the probable performance bottleneck. We implemented a prototype system of the proposed architecture based on a commercial workflow management system, Agentflow. A series of experiments were conducted on the prototype system for performance evaluation. The experimental results indicate that the proposed architecture can deliver scalable performance and effectively maintain stable request response time under a wide range of incoming workflow request workloads.     

Inheritance of workflows: an approach to tackling problems related to change

Inheritance is one of the key issues of object-orientation. The inheritance mechanism allows for the definition of a subclass which inherits the features of a specific superclass. When adapting a workflow process definition to specific needs (ad-hoc change) or changing the structure of the workflow process as a result of reengineering efforts (evolutionary change), inheritance concepts are useful to check whether the new workflow process inherits some desirable properties of the old workflow process. Today's workflow management systems have problems dealing with both ad-hoc changes and evolutionary changes. As a result, a workflow management system is not used to support dynamically changing workflow processes or the workflow processes are supported in a rigid manner, i.e., changes are not allowed or handled outside of the workflow management system. In this paper, we propose inheritance-preserving transformation rules for workflow processes and show that these rules can be used to avoid problems such as the “dynamic-change bug.” The dynamic-change bug refers to errors introduced by migrating a case (i.e., a process instance) from an old process definition to a new one. A transfer from an old process to a new process can lead to duplication of work, skipping of tasks, deadlocks, and livelocks. Restricting change to the inheritance-preserving transformation rules guarantees transfers without any of these problems. Moreover, the transformation rules can also be used to extract aggregate management information in case more than one version of a workflow process cannot be avoided.     

Continuity aspects of embedded reconfigurable computing

In embedded systems, dynamically reconfigurable computing can be partially modified at runtime without stopping the operation of the whole system. In this paper, we consider a reorganization mechanism for dynamically reconfigurable computing in embedded systems to guarantee that invariants of the design are respected. This reorganization is considered as a visual transformation of the logical configuration by the formulated rules. The invariant is recognized under the restructuring of the configuration using reconfiguration rules.     

Quality of service for workflows and web service processes

Workflow management systems (WfMSs) have been used to support various types of business processes for more than a decade now. In workflows or Web processes for e-commerce and Web service applications, suppliers and customers define a binding agreement or contract between the two parties, specifying quality of service (QoS) items such as products or services to be delivered, deadlines, quality of products, and cost of services. The management of QoS metrics directly impacts the success of organizations participating in e-commerce. Therefore, when services or products are created or managed using workflows or Web processes, the underlying workflow engine must accept the specifications and be able to estimate, monitor, and control the QoS rendered to customers. In this paper, we present a predictive QoS model that makes it possible to compute the quality of service for workflows automatically based on atomic task QoS attributes. We also present the implementation of our QoS model for the METEOR workflow system. We describe the components that have been changed or added, and discuss how they interact to enable the management of QoS.     

A concept of dynamically reconfigurable real-time vision system for autonomous mobile robotics

This paper describes specific constraints of vision systems that are dedicated to be embedded in mobile robots. If PC-based hardware architecture is convenient in this field because of its versatility, flexibility, performance, and cost, current real-time operating systems are not completely adapted to long processing with varying duration, and it is often necessary to oversize the system to guarantee fail-safe functioning. Also, interactions with other robotic tasks having more priority are difficult to handle. To answer this problem, we have developed a dynamically reconfigurable vision processing system, based on the innovative features of Cleopatre real-time applicative layer concerning scheduling and fault tolerance. This framework allows to define emergency and optional tasks to ensure a minimal quality of service for the other subsystems of the robot, while allowing to adapt dynamically vision processing chain to an exceptional overlasting vision process or processor overload. Thus, it allows a better cohabitation of several subsystems in a single hardware, and to develop less expensive but safe systems, as they will be designed for the regular case and not rare exceptional ones. Finally, it brings a new way to think and develop vision systems, with pairs of complementary operators.     

一种扩展了价格信息的Petri网

提出一种扩展了价格信息的Petri网——价格Petri网，讨论了相应的分析方法和应用前景。主要工作是：为Petri网的变迁引入价格参数，并用价格变迁系统给出价格Petri网的语义；对价格Petri网进行了可达性分析并讨论了最小成本可达问题的可判定性；最后用价格Petri网建立一个业务流程的成本模型。结论是：为Petri网扩展价     

A framework for virtual enterprise operation management

This paper presents researches on operation management for virtual enterprises (VEs). A virtual enterprise is a temporary alliance of member enterprises (MEs) formed to exploit fast-changing opportunities. During the operation of a virtual enterprise, its constituent member enterprises, which are geographically distributed and organizationally independent, collaborate with each other to execute the whole business process (BP) of the virtual enterprise. With the aim of addressing business integration for virtual enterprises, this paper develops a framework for virtual enterprise operation management. From the viewpoint of business processes, carried out is integral research on business process modeling, analyzing, and managing for virtual enterprises. Both the distributed business process model and the model of the virtual enterprise itself are established. The former provides the functional basis of the virtual enterprise operation, while the latter provides its structural basis. Further, the two models are integrated through the loading from the distributed business process model to the virtual enterprise model. Through such model separation and integration, business process management for virtual enterprises is enacted and business integration for virtual enterprises is achieved.     

一种基于构件技术的工作流过程建模的方法研究

通过分析研究工作流建模的各种方法,本文提出了一种基于构件技术的工作流建模方法,引入了构件工作流网的概念和新的建模元素,使工作流过程表达更丰富,提高了可读性和重用性,给出了一个建模应用实例,并指出下一步研究工作和方向.     

Macro-programmable reconfigurable stream processor for collaborative manufacturing systems

Growing demand for high speed processing of streamed data (e.g. video-streams, digital signal streams, communication streams, etc.) in the advanced manufacturing environments requires the adequate cost-efficient stream-processing platforms. Platforms based on the embedded microprocessors often cannot satisfy performance requirements due to limitations associated with the sequential nature of data execution process. During the last decade, development and prototyping of the above embedded platforms has started moving towards utilization of the Field Programmable Gate Array (FPGA) devices. However, the programming of an application to the FPGA based platform became an issue due to relatively complicated hardware design process. The paper presents an approach which allows simplification of the application programming process by utilization of: (i) the uniformed FPGA platform with the dynamically reconfigurable architecture, (ii) a programming technique based on a temporal partitioning of the application in segments which can be described in terms of macro-operators (function specific virtual components). The paper describes the concept of the approach, presents the analytical investigation and experimental verification of the cost-effectiveness of the proposed platform comparing to the platforms based on sequential micro-processors. It is also shown that the approach can be beneficially utilized in collaborative design and manufacturing.     

A resource oriented integration architecture for the Internet of Things: A business process perspective

The vision of the Internet of Things (IoT) foresees a future Internet incorporating smart physical objects that offer hosted functionality as IoT services. These services when integrated with the traditional enterprise level services form the creation of ambient intelligence for a wide range of applications. To facilitate seamless access and service life cycle management of large, distributed and heterogeneous IoT resources, service oriented computing and resource oriented approaches have been widely used as promising technologies. However, a reference architecture integrating IoT services into either of these two technologies is still an open research challenge. In this article, we adopt the resource oriented approach to provide an end-to-end integration architecture of front-end IoT devices with the back-end business process applications. The proposed architecture promises a programmer friendly access to IoT services, an event management mechanism to propagate context information of IoT devices, a service replacement facility upon service failure, and a decentralized execution of the IoT aware business processes.     

A new verification technique for large processes based on identification of relevant tasks

Verification recently has become a challenging topic for business process languages. Verification techniques like model checking allow to ensure that a process complies with domain-specific requirements, prior to the execution. To execute full-state verification techniques like model checking, the state space of the process needs to be constructed. This tends to increase exponentially with the size of the process schema, or it can even be infinite. We address this issue by means of requirements-specific reduction techniques, i.e., reducing the size of the state space without changing the result of the verification. We present an approach that, for a given requirement the system must fulfill, identifies the tasks relevant for the verification. Our approach then uses these relevant tasks for a reduction that confines the process to regions of interest for the verification. To evaluate our new technique, we use real-world industrial processes and requirements. Mainly because these processes make heavy use of parallelization, full-state-search verification algorithms are not able to verify them. With our reduction in turn, even complex processes with many parallel branches can be verified in less than 10 s.     

Supervisory control of a multi-echelon supply chain: A modular Petri net approach for inter-organizational control

Petri nets (PNs) are frequently utilized to model system dynamics due to their ability to handle concurrencies and sequential dependence. In this paper, a portion of the supply chain operations reference (SCOR) model has been extracted and modeled using PNs for the purpose of exerting supervisory control upon a multi-echelon supply chain (SC). The activities of source, make and deliver, inherent in the SCOR model form the basis of the representation of the PN model for each echelon considered in the SC model. Two control nets are utilized: one above the base model of each echelon to exert local constraints and an enterprise level supply chain manager (SCM). The local constraints are at the tactical and operational levels while the SCM enforces additional constraints consisting of long term planning goals at the strategic level. Place invariants are used to create the supervisors. Performance measures of the total SC are formulated to determine the effectiveness of any partnership. An efficient method for finding the current state of the system is developed which is used to determine the performance measures of each echelon. This paper presents a modular approach to the overall structure and PN modeling for a SC system. It is intended to extend the use of supervisory control from a shop-floor level to an inter-organizational facility and enterprise level.     

Business process mining: An industrial application

Contemporary information systems (e.g., WfM, ERP, CRM, SCM, and B2B systems) record business events in so-called event logs. Business process mining takes these logs to discover process, control, data, organizational, and social structures. Although many researchers are developing new and more powerful process mining techniques and software vendors are incorporating these in their software, few of the more advanced process mining techniques have been tested on real-life processes. This paper describes the application of process mining in one of the provincial offices of the Dutch National Public Works Department, responsible for the construction and maintenance of the road and water infrastructure. Using a variety of process mining techniques, we analyzed the processing of invoices sent by the various subcontractors and suppliers from three different perspectives: (1) the process perspective, (2) the organizational perspective, and (3) the case perspective. For this purpose, we used some of the tools developed in the context of the ProM framework. The goal of this paper is to demonstrate the applicability of process mining in general and our algorithms and tools in particular.     

Design of a service oriented architecture for efficient resource allocation in media environments

In many business domains, Grids and Service Oriented Architectures are considered to improve application design, integration and execution. In the audiovisual industry, applications are very data-intensive, time-constrained and computationally demanding, and design of a Service Oriented Architecture in this domain is no straightforward task. Efficient resource allocation-especially in terms of network usage-is paramount to meet users’ requirements in terms of deadlines and responsiveness, and offer high scalability at the same time. We present a resource- and network-aware management architecture addressing the issues in media environments, incorporating a number of scheduling algorithms and advance reservation systems to ensure efficient resource usage.     

Hierarchical representation of on-chip context to reduce reconfiguration time and implementation area for coarse-grained reconfigurable architecture

In reconfigurable system, fast reconfiguration and small size of configuration contexts are strongly required to enhance the processing performance and reduce the implementation overhead. In this paper, a hierarchical representation of contexts for CGRA called HCC is proposed to satisfy the above requirements. In HCC, the contexts are constructed in a hierarchical fashion to thoroughly eliminate the repetitive portions of the contexts, not only reducing the overall contexts storage size, but also alleviating the contexts transportation overhead. The fast context-indexing mechanism is proposed in HCC to achieve high configuration speed, since the hierarchically organized contexts can be located and accessed conveniently. HCC has been verified in a reconfigurable processor called REMUS_HP. Owing to HCC, when implementing H.264 decoding on REMUS_HP, 76.67% of the overall contexts are reduced compared with the traditional non-hierarchical one; and the configuration speed is averagely 23× increased compared with the latest reported optimized configuration mechanism on Virtex-4 FX60. REMUS_HP is implemented on a 48.9 mm^2 silicon with TSMC 65 nm technology. Simulation shows that 1920 ×1088@30 fps could be achieved for H.264 high-profile decoding when exploiting a 200 MHz working frequency. Compared with the high performance version of XPP, the performance is 181% boosted.     

COCOA: COnversation-based service COmposition in pervAsive computing environments with QoS support

Pervasive computing environments are populated with networked services, i.e., autonomous software entities, providing a number of functionalities. One of the most challenging objectives to be achieved within these environments is to assist users in realizing tasks that integrate on the fly functionalities of the networked services opportunely according to the current pervasive environment. Towards this purpose, we present COCOA, a solution for COnversation-based service COmposition in pervAsive computing environments with QoS support. COCOA provides COCOA-L, an OWL-S based language for the semantic, QoS-aware specification of services and tasks, which further allows the specification of services and tasks conversations. Moreover, COCOA provides two mechanisms: COCOA-SD for the QoS-aware semantic service discovery and COCOA-CI for the QoS-aware integration of service conversations towards the realization of the user task’s conversation. The distinctive feature of COCOA is the ability of integrating on the fly the conversations of networked services to realize the conversation of the user task, by further meeting the QoS requirements of user tasks. Thereby, COCOA allows the dynamic realization of user tasks according to the specifics of the pervasive computing environment in terms of available services and by enforcing valid service consumption.     

A computer network based control architecture for autonomous distributed multirobot systems

This paper presents the specification and implementation procedure using a microcomputer network based autonomous distributed control architecture for industrial multirobot systems. The procedure is based on the concept of data flow network controlled by communicating sequential processes to perform coordinated tasks. Robots and other computerized industrial devices such as conveyors and manufacturing machines are defined as object-oriented Petri nets. A modular and hierarchical approach is adopted to define a set of Petri net type diagrams which represent concurrent activities of control processes for such devices. Asynchronous and synchronous interactions are modelled by places and transitions, respectively, in global process interaction nets. The control software is implemented on a computer network using Inmos transputers with true parallel processing and message passing primitives efficiently handled in hardware. Petri net based models are directly and efficiently transformed to corresponding codes in occam, the high level parallel programming language defined for the transputer.     

A distributed approach for fault detection and diagnosis based on Time Petri Nets

This paper proposes an algorithm for the model based design of a distributed protocol for fault detection and diagnosis for very large systems. The overall process is modeled as different Time Petri Net (TPN) models (each one modeling a local process) that interact with each other via guarded transitions that becomes enabled only when certain conditions (expressed as predicates over the marking of some places) are satisfied (the guard is true). In order to use this broad class of time DES models for fault detection and diagnosis we derive in this paper the timing analysis of the TPN models with guarded transitions. In this paper we also extend the modeling capability of the faults calling some transitions faulty when operations they represent take more or less time than a prescribed time interval corresponding to their normal execution. We consider here that different local agents receive local observation as well as messages from neighboring agents. Each agent estimates the state of the part of the overall process for which it has model and from which it observes events by reconciling observations with model based predictions. We design algorithms that use limited information exchange between agents and that can quickly decide “questions” about “whether and where a fault occurred?” and “whether or not some components of the local processes have operated correctly?”. The algorithms we derive allow each local agent to generate a preliminary diagnosis prior to any communication and we show that after communicating the agents we design recover the global diagnosis that a centralized agent would have derived. The algorithms are component oriented leading to efficiency in computation.