Discovering Petri Net Models of Discrete-Event Processes by Computing T-Invariants

International audienceThis paper addresses the problem of discovering a Petri Net (PN) from a long event sequence representing the behavior of discrete-event processes. A method for building a 1-bounded PN able to execute the events sequence S is presented; it is based on determining causality and concurrence relations between events and computing the t-invariants. This novel method determines the structure and the initial marking of an ordinary PN, which reproduces the behavior in S. The algorithms derived from the method are efficient and have been implemented and tested on numerous examples of diverse complexity. Note to Practitioners—Model discovery is useful to perform reverse engineering of ill-known systems. The algorithms proposed in this paper build 1-bounded PN models, which are enough powerful to describe many discrete-event processes from industry. The efficiency of the method allows processing very large sequences. Thus, an automated modeling tool can be developed for dealing with data issued from real systems

Discovering Hierarchical Process Models: an Approach Based on Events Clustering

Process mining is a field of computer science that deals with discovery and analysis of process models based on automatically generated event logs. Currently, many companies use this technology for optimization and improving their processes. However, a discovered process model may be too detailed, sophisticated and difficult for experts to understand. In this paper, we consider the problem of discovering a hierarchical business process model from a low-level event log, i.e., the problem of automatic synthesis of more readable and understandable process models based on information stored in event logs of information systems. Discovery of better structured and more readable process models is intensively studied in the frame of process mining research from different perspectives. In this paper, we present an algorithm for discovering hierarchical process models represented as two-level workflow nets. The algorithm is based on predefined event ilustering so that the cluster defines a sub-process corresponding to a high-level transition at the top level of the net. Unlike existing solutions, our algorithm does not impose restrictions on the process control flow and allows for concurrency and iteration

A Hybrid Approach to Modeling Biological Systems

This paper investigates a hybrid approach to modeling molecular interactions in biology. P systems, π-calculus, and Petri nets models, and two tools, Daikon, used in software reverse-engineering, and PRISM, a probabilistic model checker, are investigated for their expressiveness and complementary roles in describing and analyzing biological systems. A simple case study illustrates this approach

Business Process Improvement of Production Systems Using Coloured Petri Nets

The quality of information systems affects the company's business performance. Therefore, it is necessary to analyze business processes to determine any discrepancies between the planned business processes and the actual ones. Based on the results of this analysis, the business process can be improved. The fundamental factor of manufacturing companies is production process. In reality, there are many discrepancies between the actual business processes with the pre-planned, so that there should be analyzed. The analysis can be performed by modeling the business process using Coloured Petri Nets (CPN). In this study, the objectives are to determine the level of conformance checking of business processes, reachability graph and the bottleneck analysis. The results of the analysis are used to construct a recommended model. Based on the analysis of the case study, e.g. a steel industry in Indonesia, the recommended model has a better value than initial model

Design and Development of Software Tools for Bio-PEPA

This paper surveys the design of software tools for the Bio-PEPA process algebra. Bio-PEPA is a high-level language for modelling biological systems such as metabolic pathways and other biochemical reaction networks. Through providing tools for this modelling language we hope to allow easier use of a range of simulators and model-checkers thereby freeing the modeller from the responsibility of developing a custom simulator for the problem of interest. Further, by providing mappings to a range of different analysis tools the Bio-PEPA language allows modellers to compare analysis results which have been computed using independent numerical analysers, which enhances the reliability and robustness of the results computed.

Engineering framework for service-oriented automation systems

Tese de doutoramento. Engenharia Informática. Universidade do Porto. Faculdade de Engenharia. 201

Tools and Algorithms for the Construction and Analysis of Systems

This book is Open Access under a CC BY licence. The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019. The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows: Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning. Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems