From non-autonomous Petri net models to executable state machines

Petri nets have long been known as a readable and powerful graphical modelling language. In particular, Petri nets also allow the creation of high-level models of embedded controllers. These models can be translated to executable code. This possibility is already available in some tools including the IOPT Tools. Another possibility is to translate the Petri net model into a state machine, which can then be easily executed by an even larger number of platforms for cyber-physical systems. In that sense, this paper presents a tool that is able to generate a state machine from a non-autonomous class of Petri supported by the IOPT Tools framework (which is publicly available). These state machines would be too large to be manually generated, but can now be automatically created, simulated, and verified using an higher-level modelling language. The state machines can then be used for execution or even as input for additional verification tools. This paper presents the translation algorithm and an illustrative example.This work was partially financed by Portuguese Agency FCT Fundação para a Ciência e Tecnologia, in the framework of project UID/EEA/00066/2019

A Taxonomy of Workflow Management Systems for Grid Computing

With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed resources. Such application scenarios require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflow management systems for Grid computing. In this paper, we propose a taxonomy that characterizes and classifies various approaches for building and executing workflows on Grids. We also survey several representative Grid workflow systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the design and engineering similarities and differences of state-of-the-art in Grid workflow systems, but also identifies the areas that need further research.Comment: 29 pages, 15 figure

Design of testbed and emulation tools

The research summarized was concerned with the design of testbed and emulation tools suitable to assist in projecting, with reasonable accuracy, the expected performance of highly concurrent computing systems on large, complete applications. Such testbed and emulation tools are intended for the eventual use of those exploring new concurrent system architectures and organizations, either as users or as designers of such systems. While a range of alternatives was considered, a software based set of hierarchical tools was chosen to provide maximum flexibility, to ease in moving to new computers as technology improves and to take advantage of the inherent reliability and availability of commercially available computing systems

A Case Study on Coloured Petri Nets in object-oriented analysis and design

Selected Papers of the Second International Workshop on Model-Based Methodologies for Pervasive and Embedded Software (MOMPES'05), June 6, 2005, Rennes, France.In this paper,we first demonstrate how a coloured Petri nets(CPN) model can be used to capture requirements for a considered example system, an elevator controller. Then, we show how this requirements-level CPN model is transformed into a design-level object-oriented CPN model, which is structurally and conceptually closer to class diagrams and object-oriented programming languages. The CPN models reduce the gap between user-level requirements and the respective implementation, thus simplifying the imple- mentation or code generation. Finally, we discuss the code generation from object-oriented CPN models

Extracting Petri Modules From Large and Legacy Petri Net Models

Petri nets, even though very useful for modeling of discrete event systems, suffer from some weaknesses such as huge size, huge state space, and slow in simulation. Due to the huge state space, model checking a Petri net is difficult. Also, due to the slowness in simulation, discrete-timed Petri nets cannot be used for real-time applications. Thus, modular Petri nets are suggested as a way of overcoming these difficulties. In modular Petri nets, modules are designed, developed, and run independently, and the modules communicate with each other via inter-modular connectors. This approach is suggested for developing newer Petri net models. However, there exists a large number of Petri net models of real-life systems, and these legacy models are enormous and non-modular. And, these models cannot be discarded as large amounts of time and money were spent to develop these models. This paper presents a unique algorithm for extracting modules from large and legacy Petri net models. The algorithm extracts modules (known as “Petri modules”) that are well-defined for inter-modular collaboration. Also, the extraction method preserves the structural properties. The goal of the paper is to introduce a methodology by which Petri nets can be moved to a new level in which a modular Petri net model can be made of Petri modules. The Petri modules are independent and can be hosted on different computers. These modules communicate via inter-modular components such as TCP/IP sockets. Since Petri modules are compact, also run faster, thus become suitable for supervisory control of real-time systems.publishedVersio

Third Workshop on Modelling of Objects, Components, and Agents

This booklet contains the proceedings of the Third International Workshop on Modelling of Objects, Components, and Agents (MOCA'04), October 11-13, 2004. The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark and the "Theoretical Foundations of Computer Science" group at the University of Hamburg. The home page of the workshop is: http://www.daimi.au.dk/CPnets/workshop0

Intelligent Business Process Optimization for the Service Industry

The company\u27s sustainable competitive advantage derives from its capacity to create value for customers and to adapt the operational practices to changing situations. Business processes are the heart of each company. Therefore process excellence has become a key issue. This book introduces a novel approach focusing on the autonomous optimization of business processes by applying sophisticated machine learning techniques such as Relational Reinforcement Learning and Particle Swarm Optimization

Autonomic Protocol-based Coordination in Dynamic Inter-Organizational Workflow

International audienceGiven the maturity of Internet standards, inter-organizational workflow is expected to be deployed in environments that are more dynamic and open than before. This paper addresses Inter Organizational Workflow (IOW) coordination in such a context, mainly investigating autonomic coordination managed at run-time. It is based on the idea that an agent-based approach is suitable to deal with this issue. More precisely, this paper introduces a framework for dynamic IOW in which involved processes are encapsulated into agents, called Process Agents (PA) in order to give them the capability to autonomously decide with whom, when and how to cooperate, and in which involved processes can access protocol components for their coordination needs. Our approach is based on the capability of PAs in playing different coordination protocols in order to take part in new business opportunities. This solution has numerous advantages. First, it provides extendable and reusable coordination components. Then, it supports run-time protocol integration. Finally, it eases openness since it imposes very few constraints

Intelligent Business Process Optimization for the Service Industry

The company's sustainable competitive advantage derives from its capacity to create value for customers and to adapt the operational practices to changing situations. Business processes are the heart of each company. Therefore process excellence has become a key issue. This book introduces a novel approach focusing on the autonomous optimization of business processes by applying sophisticated machine learning techniques such as Relational Reinforcement Learning and Particle Swarm Optimization

Search-based system architecture development using a holistic modeling approach

This dissertation presents an innovative approach to system architecting where search algorithms are used to explore design trade space for good architecture alternatives. Such an approach is achieved by integrating certain model construction, alternative generation, simulation, and assessment processes into a coherent and automated framework. This framework is facilitated by a holistic modeling approach that combines the capabilities of Object Process Methodology (OPM), Colored Petri Net (CPN), and feature model. The resultant holistic model can not only capture the structural, behavioral, and dynamic aspects of a system, allowing simulation and strong analysis methods to be applied, it can also specify the architectural design space. Both object-oriented analysis and design (OOA/D) and domain engineering were exploited to capture design variables and their domains and define architecture generation operations. A fully realized framework (with genetic algorithms as the search algorithm) was developed. Both the proposed framework and its suggested implementation, including the proposed holistic modeling approach and architecture alternative generation operations, are generic. They are targeted at systems that can be specified using object-oriented or process-oriented paradigm. The broad applicability of the proposed approach is demonstrated on two examples. One is the configuration of reconfigurable manufacturing systems (RMSs) under multi-objective optimization and the other is the architecture design of a manned lunar landing system for the Apollo program. The test results show that the proposed approach can cover a huge number of architecture alternatives and support the assessment of several performance measures. A set of quality results was obtained after running the optimization algorithm following the proposed framework --Abstract, page iii