1985 ◽  
Vol 13 (174) ◽  
Author(s):  
Peter Huber ◽  
Arne M. Jensen ◽  
Leif Obel Jepsen ◽  
Kurt Jensen

<p>High-level Petri nets have been introduced as a powerful net type, by which it is possible to handle rather complex systems in a succinct and manageable way. The success of high-level Petri nets is undebatable when we speak about description, but there is still much work to be done to establish the necessary analysis methods. It has already been shown how to generalize the concept of place-invariants and transition-invariants, from place-transition-nets to high-level Petri nets. Our present paper constitutes the first steps towards a generalization of reachability trees, which is one of the other important analysis methods known for PT-nets.</p><p>The central idea in our paper is the observation, that HL-nets often possess classes of equivalent markings. As an example an HL-net describing the five dining philo\-sophers has an equivalence-class consisting of those five markings in which exactly one philosopher is eating. These five markings are interchangeable, in the sense that their subtrees represent equivalent behaviours, where the only difference is the identity of the involved philosophers and forks. If we analyze one of these subtrees, we also understand the behaviour of the others.</p><p>We describe an algorithm which constructs the HL-tree. The algorithm can easily be automated and we will soon start the work on an implementation. The constructed HL-trees turn out to be considerably smaller than the corresponding PT-trees (reachability trees for the equivalent PT-nets).</p>


2021 ◽  
Vol 16 (4) ◽  
pp. 35-47
Author(s):  
Vadim V. Borisov ◽  
◽  
Anton Е. Misnik ◽  
Siarhei А. Prakapenka ◽  
Viktor V. Kutuzov ◽  
...  

The article is devoted to the implementation of a method for modeling processes in complex educational systems based on the proposed variety of neuro-fuzzy temporal Petri nets. The article considers educational systems of the level of higher educational institutions, which, of course, belong to the class of complex systems. The need for a method, models and modeling tools is dictated by the fact that modern educational processes require constant modernization, due to the constantly growing volumes of information, changes in legislation, stricter requirements for specialists, rapid development of technologies, constant discoveries in various fields, as well as the influence of external factors. Requirements for the tools for modeling processes in complex systems are formulated, the use of Petri nets as the basis of such models is substantiated. The existing educational processes are considered on the example of the cycle of training in the master's program of the Belarusian-Russian University. The model of educational and information-analytical learning processes in the master's program based on the neuro-fuzzy temporal Petri net is presented. The proposed method allows to increase the flexibility of the choice of individual trajectories of training in the master's program, the effectiveness of elective disciplines and to make the transition to an integrated approach in the preparation of undergraduates. The proposed method can also be used as a basis for monitoring the state and control of information and analytical processes in educational systems. An approach to the construction of software-instrumental environment for the design and modification of information-analytical processes is described, aimed, among other things, at bridging the semantic gap between experts, architects and developers of information-analytical processes. A subsystem for the formation of a neuro-fuzzy temporal model of processes within the framework of a software-instrumental environment is considered.


Author(s):  
Julio Clempner

A hierarchical decomposition of decision process Petri nets for modeling complex systemsWe provide a framework for hierarchical specification called Hierarchical Decision Process Petri Nets (HDPPNs). It is an extension of Decision Process Petri Nets (DPPNs) including a hierarchical decomposition process that generates less complex nets with equivalent behavior. As a result, the complexity of the analysis for a sophisticated system is drastically reduced. In the HDPPN, we represent the mark-dynamic and trajectory-dynamic properties of a DPPN. Within the framework of the mark-dynamic properties, we show that the HDPPN theoretic notions of (local and global) equilibrium and stability are those of the DPPN. As a result in the trajectory-dynamic properties framework, we obtain equivalent characterizations of that of the DPPN for final decision points and stability. We show that the HDPPN mark-dynamic and trajectory-dynamic properties of equilibrium, stability and final decision points coincide under some restrictions. We propose an algorithm for optimum hierarchical trajectory planning. The hierarchical decomposition process is presented under a formal treatment and is illustrated with application examples.


2018 ◽  
Vol 28 (2) ◽  
pp. 269-281 ◽  
Author(s):  
Ben Li ◽  
Manel Khlif-Bouassida ◽  
Armand Toguyéni

Abstract This paper considers the problem of diagnosability analysis of discrete event systems modeled by labeled Petri nets (LPNs). We assume that the LPN can be bounded or unbounded with no deadlock after firing any fault transition. Our approach is novel and presents the on-the-fly diagnosability analysis using verifier nets. For a given LPN model, the verifier net and its reachability graph (for a bounded LPN) or coverability graph (for an unbounded LPN) are built on-the-fly and in parallel for diagnosability analysis. As soon as a diagnosability decision is established, the construction is stopped. This approach achieves a compromise between computation limitations due to efficiency and combinatorial explosion and it is useful to implement an engineering approach to the diagnosability analysis of complex systems.


2016 ◽  
Vol 3 (1) ◽  
Author(s):  
Kirsten Sinclair ◽  
Daniel Livingstone

Difficulty understanding the large number of interactions involved in complex systems makes their successful engineering a problem. Petri Nets are one graphical modelling technique used to describe and check proposed designs of complex systems thoroughly. While automatic analysis capabilities of Petri Nets are useful, their visual form is less so, particularly for communicating the design they represent. In engineering projects, this can lead to a gap in communications between people with different areas of expertise, negatively impacting achieving accurate designs.In contrast, although capable of representing a variety of real and imaginary objects effectively, behaviour of serious games can only be analysed manually through interactive simulation. This paper examines combining the complementary strengths of Petri Nets and serious games. The novel contribution of this work is a serious game prototype of a complex system design that has been checked thoroughly. Underpinned by Petri Net analysis, the serious game can be used as a high-level interface to communicate and refine the design.Improvement of a complex system design is demonstrated by applying the integration to a proof-of-concept case study.   


Sign in / Sign up

Export Citation Format

Share Document