This paper introduces a new method of empowering Logical Petri Nets (LPN) and Fuzzy Logical Petri Nets (FLPN) [1] using multiple logic. In this paper we proposed a Multi-Logical Petri Nets (MLPN) and Multi-Logical Fuzzy Petri Nets (MLFPN) based on Logical Petri Nets (LPN) and Fuzzy Logical Petri Nets (FLPN). Here we have showed that, how multiple logic is implemented in MLPN and MLFPN. The prop...

Petri nets are suitable for modelling of discrete-event systems with highly parallel and cooperating activities. In complex man-made systems, such as manufacturing systems, the systems’ specific properties, such as conflicts, deadlocks, limited buffer sizes, and finite resource constraints can be easily represented in the Petri net model. Therefore teaching of Petri net basics is an inevitable ...

Petri nets, introduced by Carl Adam Petri [12] in 1962, provide a powerful mathematical formalism for describing and analyzing the flow of information and control in concurrent systems. Petri nets can successfully be used as control mechanisms for grammars, i.e., the generative devices of formal languages. In recent papers [4], [5], [9], [16] Petri net controlled grammars have been introduced a...

This paper discusses coloured Petri net models of so-called timed influence nets with logic. Previous work has developed a method to translate a timed influence net into a coloured Petri net. The work in this paper describes a new and more compact translation from timed influence nets with logic into coloured Petri nets. The translation has the property that the net structure of the coloured Pe...

This work treats the relationship between Petri Nets and languages. In 2003, Darondeau solved the Petri Net synthesis problem for a certain class of languages, i. e. for a given language L of this class he constructed a Petri Net generating the least Petri Net language containing L. Furthermore, he developed a decision procedure which tests for equality of these two languages. It is proved here...

In the sequel M is a Petri net. Let us consider X , Y . Let us assume that X misses Y . The functor PTempty f (X ,Y ) yielding a strict Petri net is defined by: (Def. 4)2 PTempty f (X ,Y ) = 〈X ,Y, / 0〉. Let us consider X . The functor Tempty f (X) yields a strict Petri net and is defined by: (Def. 5) Tempty f (X) = PTempty f (X , / 0). The functor Pempty f (X) yields a strict Petri net and is ...

Approximate throughput computation of a class of discrete event systems (DES) modelled with stochastic weighted T{systems is considered. Stochastic weighted T{systems are the weighted extension of well known stochastic marked graphs Petri net subclass and are usually presented as a useful model to deal with bulk con-sumptions or productions of resources in manufacturing systems working on a cyc...

Petri net schemata are an intuitive and expressive approach to describe high-level Petri nets. A Petri net schema is a Petri net with edges and transitions inscribed by terms and Boolean expressions, respectively. A concrete high-level net is gained by interpreting the symbols in the inscriptions by a structure. Its semantics can then be described in terms of a transition system. Therefore, the...