This paper addresses the problem of forbidden states of non safe Petri Net (PN) modelling discrete events systems. To prevent the forbidden states, it is possible to use conditions or predicates associated with transitions. Generally, there are many forbidden states, thus many complex conditions are associated with the transitions. A new idea for computing predicates in non safe Petri nets will...

This paper presents an identification method of partially observable Discrete Event Systems (DES) using ordinary Petri Nets. The proposed method is absolute, sequential and multiple. It consists in building the compartmental model, computed off-line, for a DES in a Petri Net (PN) form. The developed method is based on the use of the input/output sequences constructed during the system evolution...

With the continuous development of science and technology, the development of the enterprise also requires the agility of enterprises. At present,SOA is one of the most popular means of achieving enterprise's agility.This article embarks on the Petri net model to study the service modeling method of information management software. Firstly, it introduces service-oriented architecture SOA and th...

This paper introduces a method to combine nite automata, parallel programs and SDL (Speciication and Description Language) speciications. We base our approach on M-nets exploiting the rich set of composition operators available in this algebra of high-level Petri nets. In order to be able to combine diierent modelling techniques, we rely on compatible interfaces. Therefore, { we extend an exist...

In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes. Well-formed business processes correspond to sound workflow nets. Even if it seems necessary to require the soundness of workflow nets, there exist business processes with conditional behavio...

A Petri net (PN) 2, 3] is said to be live if it is possible to re any transition from every reachable marking, although not necessarily immediately. In this paper we consider the issue of enforcing liveness in non-live PNs via supervisory control. Using a construction procedure , similar to that in reference 1], that converts an arbitrary PN into an equivalent member of a family of PNs called F...

The complete exploration of large system states modeled with Petri net (PN) systems demonstrates state space explosion, limiting reachability analysis. The calculation of the number of states (samples) necessary to conduct a statistical hypothesis test for reachability problems of PN systems is discussed in this paper. The calculation is based on the estimation of the size of the state space. T...

Following the proposal for a Petri Net (PN) representation of the Context Free Grammar (CFG), we propose in this paper, an algorithm to eliminate the useless productions of CFG. First the CFG is represented by a PN. Then, based on the reachability, an algorithm is developed to eliminate Useless-productions. The algorithm is analyzed and implemented in Pascal using examples of a CFG. The propose...

Many studies have shown that the careful planning of construction logistics can result in significant saving. However, despite attempts to improve the logistics of construction materials, the purchase, delivery, storage and movement of materials are still conducted in a rather unstructured manner. In this paper, construction logistics are modeled and analyzed using Petri Net (PN) techniques. Th...