logo
    A process-control and diagnostic tool based on continuous fuzzy Petri nets
    11
    Citation
    17
    Reference
    10
    Related Paper
    Citation Trend
    Stochastic Petri net
    Process architecture
    Petri dish
    Expressive power
    Stochastic modelling
    To model and analyze systems, whose overall correctness depend on time, a powerful formalism called Petri net can be used. Several extensions of Petri nets that are dealing with time have been proposed (i.e. Timed Petri Nets, Stochastic Petri Nets). In this paper we deal with high-level Petri nets called Environment Relationship nets (ER nets for short) and their special type called Time Basic nets (TB nets for short). Aim of this paper is to put a light on the possibility of solving the reachability problem for TB nets. We will introduce some methods and constructions that help us to solve this crucial problem.
    Stochastic Petri net
    Process architecture
    Formalism (music)
    Reachability problem
    Petri nets are frequently used for modeling and analysis of discrete event systems. Similar to other modeling formalisms for discrete systems,  it suffers from state explosion. Fluidification can be used to overcome this difficulty yielding  fluid approximation of original Petri nets  in the sense of behaviours and  properties. This models are called  continuous Petri nets. In this work, stochastic Petri nets and their fluid approximation timed continuous Petri nets is considered. One of the main advantages of timed continuous Petri nets is to be able to design a controller by using more analytical techniques. But it is important to come back to a reasonable design or control in the original discrete setting.  In this work, a target state control strategy of timed continuous Petri nets will be interpreted for the control of underlying Stochastic Petri nets.  The efficiency of this interpretation  will be studied  on  a table factory system. Petri nets are frequently used for modeling and analysis of discrete event systems. Similar to other modeling formalisms for discrete systems,  it suffers from state explosion. Fluidification can be used to overcome this difficulty yielding  fluid approximation of original Petri nets  in the sense of behaviours and  properties. This models are called  continuous Petri nets. In this work, stochastic Petri nets and their fluid approximation timed continuous Petri nets is considered. One of the main advantages of timed continuous Petri nets is to be able to design a controller by using more analytical techniques. But it is important to come back to a reasonable design or control in the original discrete setting.  In this work, a target state control strategy of timed continuous Petri nets will be interpreted for the control of underlying Stochastic Petri nets.  The efficiency of this interpretation  will be studied  on  a table factory system.
    Stochastic Petri net
    Process architecture
    Citations (0)
    Interval time Petri nets are Petri nets in which time intervals are associated to transitions. Their quantitative analysis basically consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem several methods have been proposed in the literature, that either allow to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. The alternative method proposed here consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri nets by exploiting their structural properties and/or by applying operational laws. The performance bound computation is not a new technique: it has been proposed for timed Petri nets. In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri nets.
    Stochastic Petri net
    Process architecture
    Bounding overwatch
    Interval arithmetic
    Citations (8)
    Fluid Stochastic Petri nets(FSPN)model only can include at most one or two continuous places for numerical analysis.To analyze FSPN model by First-Order Hybrid Petri Nets(FOHPN)model,the formal conversion from Fluid Stochastic Petri nets to First-Order Hybrid Petri Nets is presented.Also,the effectiveness of the proposed conversion is proofed.Through case study,the necessity of the conversion is illustrated.
    Stochastic Petri net
    Process architecture
    Petri dish
    Citations (0)
    Discrete-Event Systems are discrete in nature, driven by discrete events. Petri Nets are one of the mostly used tools for their modelling and control synthesis. Place/Transitions Petri Nets, Timed Petri Nets, Controlled Petri Nets are suitable when a modelled object is deterministic. When the system model contains uncontrollable/unobservable transitions and unobservable/unmeasurable places or other failures, such kinds of Petri Nets are insufficient for the purpose. In such a case Labelled Petri Nets and/or Interpreted Petri Nets have to be used. Particularities and mutual differences of individual kinds of Petri Nets are pointed out and their applicability to modelling and control of Discrete-Event Systems are described and tested.
    Unobservable
    Process architecture
    Stochastic Petri net
    Petri dish
    Citations (5)
    Petri nets are a well known formalism for modeling and verification of different kinds of systems. Today's time-critical systems require wide and precise modeling capabilities. For this reason different extension of Petri nets have been proposed, such as Time and Timed Petri nets, Stochastic Petri nets or Time Basic nets. In this paper we will focus our attention to Time Basic Nets, because they have a bigger modeling power then Time Petri nets and can be verified more easily then Stochastic Petri nets.
    Process architecture
    Stochastic Petri net
    Formalism (music)
    Expressive power
    Citations (3)
    There exist several ways to augment Petri nets with time. The most popular approach is to assign times to transitions as time Petri nets (Merlin, 1974) or timed Petri nets (Ramchandani, 1974) do. It is, however, also possible to augment places, edges, or tokens of a Petri net with time. Within this paper we consider Petri nets with time augmented places as introduced in Coolahan and Roussopoulos (1983) which we call Petri nets with delaying places (PNDP). We present an approach that allows non-reachability to be proved in PNDP's using a state equation. Due to a lack of space, we only present our main results
    Process architecture
    Stochastic Petri net
    Petri dish
    Citations (0)
    Preface. 1. Introduction. 2. Petri Nets. 3. Deterministic Timed Petri Nets. 4. Time Petri Nets. 5. Stochastic Timed Petri Nets and Stochastic Petri Nets. 6. Generalized Stochastic Petri Nets. 7. High-Level Stochastic Petri Nets. 8.Semi-Markovian Stochastic Petri Nets. 9. Arbitrary Stochastic Petri Nets. Bibliography. Index.
    Stochastic Petri net
    Process architecture
    Petri dish
    Stochastic modelling
    Citations (331)
    Interval time Petri nets are Petri nets in which time intervals are associated to transitions. Their quantitative analysis basically consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem several methods have been proposed in the literature, that either allow to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. The alternative method proposed here consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri nets by exploiting their structural properties and/or by applying operational laws. The performance bound computation is not a new technique: it has been proposed for timed Petri nets. In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri nets.
    Stochastic Petri net
    Process architecture
    Bounding overwatch
    Interval arithmetic
    Citations (5)