Modelling, reduction and analysis of Markov automata (extended version)

Markov automata (MA) constitute an expressive continuous-time compositional modelling formalism. They appear as semantic backbones for engineering frameworks including dynamic fault trees, Generalised Stochastic Petri Nets, and AADL. Their expressive power has thus far precluded them from effective analysis by probabilistic (and statistical) model checkers, stochastic game solvers, or analysis tools for Petri net-like formalisms. This paper presents the foundations and underlying algorithms for efficient MA modelling, reduction using static analysis, and most importantly, quantitative analysis. We also discuss implementation pragmatics of supporting tools and present several case studies demonstrating feasibility and usability of MA in practice

TokenPasser: A petri net specification tool

In computer program design it is essential to know the effectiveness of different design options in improving performance, and dependability. This paper provides a description of a CAD tool for distributed hierarchical Petri nets. After a brief review of Petri nets, Petri net languages, and Petri net transducers, and descriptions of several current Petri net tools, the specifications and design of the TokenPasser tool are presented. TokenPasser is a tool to allow design of distributed hierarchical systems based on Petri nets. A case study for an intelligent robotic system is conducted, a coordination structure with one dispatcher controlling three coordinators is built to model a proposed robotic assembly system. The system is implemented using TokenPasser, and the results are analyzed to allow judgment of the tool

An NMF solution for the Petri Nets to State Charts case study at the TTC 2013

Software systems are getting more and more complex. Model-driven engineering (MDE) offers ways to handle such increased complexity by lifting development to a higher level of abstraction. A key part in MDE are transformations that transform any given model into another. These transformations are used to generate all kinds of software artifacts from models. However, there is little consensus about the transformation tools. Thus, the Transformation Tool Contest (TTC) 2013 aims to compare different transformation engines. This is achieved through three different cases that have to be tackled. One of these cases is the Petri Net to State Chart case. A solution has to transform a Petri Net to a State Chart and has to derive a hierarchical structure within the State Chart. This paper presents the solution for this case using NMF Transformations as transformation engine.Comment: In Proceedings TTC 2013, arXiv:1311.7536. arXiv admin note: substantial text overlap with arXiv:1312.034

A Compiler and Runtime Environment for Execution of Coloured Petri Net Models

Reliance on software systems is ever increasing in our world. Alongside the application of concurrent software systems that embody communication, syn- chronization and resource sharing. Many problems in software engineering have strict requirements regarding concurrency and correctness. Designing correct concurrent software is challenging, and a range of formalisms and tools exists that can help the development process. Coloured Petri nets are an extension of the mathematical concept of Petri nets and a widely used language for spec- ification and modelling concurrent systems. CPN Tools is a tool for editing, simulating, and analyzing Coloured Petri nets models. A need has been iden- tified to develop new software tools to execute Coloured Petri net models to facilitate further development and increase portability. This thesis proposes a compiler and a runtime environment for Coloured Petri nets using the F# pro- gramming language and the .NET platform. The result is a CPN simulation system consisting of a compiler that can parse a .cpn file and generate code and a simulator that can use the code generated and execute the model. A state-space exploration strongly supports the functional correctness of the system.Masteroppgave i Programutvikling samarbeid med HVLPROG399MAMN-PRO

A performance analysis tool of discrete-events systems

The analysis of the logic correctness of the system and its performance evaluation are usually carried out using, respectively, the Petri nets formalism and the discrete-event simulation. Several tools exist for both. The Platform Independent Petri Net Editor (PIPE) is a free software tool developed in Java for the modelling, simulation and qualitative analysis of Petri nets. It has been designed with an open philosophy so that extensions can be easily incorporated. SIMAN is one of the first discrete-event simulation languages developed. It has extensively proven its power. This paper first presents a module for the PIPE software that allows the automatic generation of SIMAN code from a Petri net. Then, a tool is proposed to aid the performance analysis of manufacturing systems from its SIMAN model. These tools are designed as a support for students in the understanding of the simulation methodology

Fuzzy-Petri-Net Reasoning Supervisory Controller and Estimating States of Markov Chain Models

Markov chain models are efficient tools for representing stochastic discrete event processes with wide applications in decision and control. A novel approach to fuzzy-Petri-net reasoning generated solution to initial or another state in Markov-chain models is proposed. Reasoning is performed by a fuzzy-Petri-net supervisory controller employing a fuzzy-rule production system design and a fuzzy-Petri-net reasoning algorithm, which has been developed and implemented in C++. The reasoning algorithm implements calculation of the degrees of fulfilment for all the rules and their appropriate assignment to places of Petri net representation structure. The reasoning process involves firing active transitions and calculating degrees of fulfilment for the output places, which represent propositions in the knowledge base, and determining of fuzzy-distributions for output variables as well as their defuzzified values. Finally, these values are transferred to assign the state of Markov-chain decision model in terms of transition probabilities

Applications of Petri nets

Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2008Includes bibliographical references (leaves: 51-52)Text in English; Abstract: Turkish and Englishix, 52 leavesPetri nets are powerful formalism for modeling a wide range of dynamic systems and system behaviors. This thesis surveys the basic concept and application of Petri nets. The structure of Petri nets, their marking and execution and several examples of Petri net modeling. In this thesis we research into the analysis of Petri nets. Also we give the structure of Reachability graphs of Petri nets and their advantages for analyzing the Petri nets. The reachability problem for Petri nets is the problem of finding if Mn 2 R(M0) for a given marking Mn in a net (N,M0).We present several different kinds of Petri nets, together with computer tools based on Mathematica. We give the Mathematica commands for Reachability problem and also we created Mathematica commands for Incidence matrix of Petri nets. We study the concept of Petri nets and applications of Petri nets.We especially focus on Biological applications on Petri nets and we work on modeling of Hashimoto.s Thyroiditis in Petri Nets

A guided tour of P-Nut (Release 2.2)

P-NUT is a suite of tools for constructing and analyzing Petri Net models. The tools have been developed at UCI to aid researchers in applying Petri Nets to the design of concurrent hardware/software. The tools support state-space analysis, simulation, performance evaluation and verification. While the tools are useful in their current state, the P-NUT system is just beginning to achieve its overall objective of aiding in the design of complex distributed real-time systems. This report provides a guided tour of the tools for researchers who are interested in exploring P-NUT's capabilities

Basit bir makine - iki ürün sisteminin petri ağları kullanılarak modellenmesi, analizi ve simulasyonu

As in many engineering fields, the design of manufacturing systems can be carried out using models. Petri nets have been used extensively to model and analyze manufacturing systems. Petri Nets, as graphical and mathematical tools, provide a uniform environment for modeling, format analysis and design of discrete event systems. The modeling, simulation and analysis of simple one machine-two product systems using Petri nets will be presented in this paper. Behavioral and structural properties of the Petri net model will be considered in details. Then, the Petri net model of one machine-two product system will be simulated using a simulation program.Çoğu mühendislik alanlarında olduğu gibi imalat sistemlerinin tasarımı, modeller kullanılarak başarılabilir. Petri ağları imalat sistemlerinin modellenmesi ve analizinde yaygın olarak kullanılmaktadır. Petri ağları, şekilsel ve matematiksel araçlar olarak kesikli olay sistemlerinin modellenmesi, biçimsel analizi ve tasarımı için düzenli, iyi bir ortam sağlar. Bu makalede, basit bir makine-iki ürün sistemlerinin Petri ağları kullanılarak modellenmesi, simülasyonu ve analizi sunulacaktır. Petri Ağı modelinin davranışsal ve yapısal özellikleri ayrıntılı olarak incelenecektir. Daha sonra bir makine-iki ürün sisteminin Petri ağı modelinin bir simülasyon programı kullanılarak simülasyonu gerçekleştirilecektir