Add to ORKGMaster's thesis in Computer sciencePetri nets are a long time established modeling concept for modelling and simulation of discrete-event systems. This thesis concerns the development of tools to perform analysis of Petri nets that contains places that are unbounded. The tools are coded in MATLAB, and produces graphical representations of reachability/coverability trees, as well as providing an interactable interface to make changes to how the generation is done.submittedVersio
Call number: LD2668 .T4 CMSC 1988 T36Master of ScienceComputing and Information Science
Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2008Includes bibliographical ref...
International audienceIn this paper, we define a class of Petri nets, called Petri nets with counter...
Petri nets represent a powerful tool for modeling the discrete event systems. The Petri net markings...
In [1], an algorithm to compute a minimal coverability tree for Petri nets has been presented. This...
Petri nets have been proposed as a fundamental model for discrete-event systems in a wide variety of...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
International audiencePetri nets have been proposed as a fundamental model for discrete-event system...
Summary: The Petri net is a very efficient model to describe and analyse the behaviour of Discrete E...
The minimal coverability set (MCS) of a Petri net is a finite representation of the downward-closure...
We solve the following problem: given an automaton that represents the coverability graph of a net, ...
This paper presents a MATLAB toolbox, called PetriBaR, for the analysis and control of Petri nets. P...
In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as...
This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set o...
Increasing desire for thorough simulation and analysis of engineered products is quickly replacing t...
Call number: LD2668 .T4 CMSC 1988 T36Master of ScienceComputing and Information Science
Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2008Includes bibliographical ref...
International audienceIn this paper, we define a class of Petri nets, called Petri nets with counter...
Petri nets represent a powerful tool for modeling the discrete event systems. The Petri net markings...
In [1], an algorithm to compute a minimal coverability tree for Petri nets has been presented. This...
Petri nets have been proposed as a fundamental model for discrete-event systems in a wide variety of...
Abstract. Time-Basic Petri nets, is a powerful formalism for model-ing real-time systems where time ...
International audiencePetri nets have been proposed as a fundamental model for discrete-event system...
Summary: The Petri net is a very efficient model to describe and analyse the behaviour of Discrete E...
The minimal coverability set (MCS) of a Petri net is a finite representation of the downward-closure...
We solve the following problem: given an automaton that represents the coverability graph of a net, ...
This paper presents a MATLAB toolbox, called PetriBaR, for the analysis and control of Petri nets. P...
In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as...
This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set o...
Increasing desire for thorough simulation and analysis of engineered products is quickly replacing t...
Call number: LD2668 .T4 CMSC 1988 T36Master of ScienceComputing and Information Science
Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2008Includes bibliographical ref...
International audienceIn this paper, we define a class of Petri nets, called Petri nets with counter...