In this paper, we propose astochastic Petri net model P-timed Workflow (WPTSPN) to specify, verify, and analyze a business process (BP) of Flexible Manufacturing System (FMS). After formalizing the semantics our model, illustrate how verifysome its properties (reachability, safety, boundedness, liveness, correctness, alive tokens, security) in P-Timed context. Next, validate relevance proposed ...

Biological systems are often very complex so that an appropriate formalism is needed for modeling their behavior. Hybrid Petri Nets, consisting of time-discrete Petri Net elements as well as continuous ones, have proven to be ideal for this task. Therefore, a new Petri Net library was implemented based on the object-oriented modeling language Modelica which allows the modeling of discrete, stoc...

    Discrete event system,   Supervisory control,   Petri Net, Constraint   This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...

Implementation of complex, real-world systems is usually preceded by extensive studies of their formal models. For systems which exhibit concurrent activities, Petri nets are a popular choice of modeling formalism, because of their ability to express concurrency, synchronization, precedence constraints and nondeterminism. Moreover, Petri nets “with time” (stochastic or timed) include the durati...

Stochastic methods are commonly used for dependability evaluation. In the mid 1970’s, stochastic evaluation was proposed for combined performance/dependability evaluation, called performability evaluation. Extending reliability evaluation to include performance related behaviors presented new challenges, most notably due to the large difference in time scale of performanceand dependability-rela...

In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold uid rather than discrete tokens. We deene a class of uid stochastic Petri nets in such a way that the discrete and continuous portions may aaect each other. Following this deenition we provide equations for their transient and steady-state behavior. We present several examples showing the utilit...

Client–server processing is a popular paradigm for distributed computing. In the development of client–server programs, the designer has first to ensure that the implementation behaves correctly, in particular that it is deadlock free. Second, he has to guarantee that the program meets predefined performance requirements. This paper addresses the issues in the analysis of client–server programs...