Search

Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines as agents and making use of a theoretical computer and statecharts, we prove that many workflow problems do not have computer-based solutions. We also demonstrate a sufficient condition under which computers are able to solve these problems. We end by discussing the relationships between our research and Petri Nets, the multi-agent framework in the literature, linear programming and workflow verification.

In this paper, we model business workflows using Harel’s statecharts. Mapping to statecharts allows us to systematically identify potential workflow problems. It also allows us to investigate specific properties inherent in actual business workflows. Our research focuses on three desirable properties of active database systems — termination, confluence, and observable determinism. For termination and confluence, we develop algorithms to provide a theoretical lens linking desirable active database system properties to workflow management systems problems. We initially validate our algorithms by mapping business workflows from a case study. Our research thus builds preliminary theory by developing a systematic method for identifying workflow problems.

In this article is presented a brief review of the work in machine translation of languages, with the conclusion that much more research needs to be done and that it does not appear that human beings will ever be relieved of the necessity of learning languages and of knowing how to use these languages effectively.

International audience; Many software systems today provide support for adaptation and reconfiguration at runtime, in response to changes in their environment. Such adaptive systems are designed to run continuously and may not be shut down for reconfiguration or maintenance tasks. The variability of such systems has to be explicitly managed, together with mechanisms that control their runtime adaptation and reconfiguration. Dynamic software product lines (DSPLs) can help to achieve this. However, dealing with evolution is particularly challenging in a DSPL, as changes made at run-time can easily lead to inconsistencies. This paper describes the challenges of evolving DSPLs using an example cyber-physical system for home automation. We discuss the shortcomings of existing work and present a reference architecture to support DSPL evolution. To demonstrate its feasibility and flexibility, we implemented the proposed reference architecture for two different DSPLs: the aforementioned cyber-physical system, which uses feature models to describe its variability, and a runtime monitoring infrastructure, which is based on decision models. To assess the industrial applicability of our approach, we also implemented the reference architecture for a real-world DSPL, an automation software system for injection molding machines. Our results provide evidence on the flexibility, performance and industrial applicability of our approach.

Recent industry requires efficient fault discovering and isolation solutions in process equipment service. This problem is a real-world problem of typically ill-defined systems, hard to model, with large-scale solution spaces. Design of precise models is impractical, too expensive, or often non-existent. Support service of equipment requires generating models that can analyze the equipment data, interpreting the past behavior and predicting the future one. These problems pose a challenge to traditional modeling techniques and represent a great opportunity for the application of AI-based methodologies, which enable us to deal with imprecise, uncertain data and incomplete domain knowledge typically encountered in real-world applications. In this paper the state of the art, theoretical background of conventional and AI-based techniques in support of service tasks and illustration of some applications to process equipment service on bio-ethanol production process are shortly described.