A contextual net is a Petri net extended with read arcs, which allow transitions to check for tokens without consuming them. Contextual nets allow for better modelling of concurrent read access than Petri nets, and their unfoldings can be exponentially more compact than those of a corresponding Petri net. A constructive but abstract procedure for generating those unfoldings was proposed in earl...

Practical experiences show that only timed and coloured Petri nets are capable of modelling large and complex real-time systems. This is the reason we present the Interval Timed Coloured Petri Net (ITCPN) model. An interval timed coloured Petri net is a coloured Petri net extended with time; time is in tokens and transitions determine a delay for each produced token. This delay is speciied by a...

A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods’ weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is exponential in the running time of their weak machine. To simulate the blank words of the weakly universal Turing machine, a couple of dedicated transitions insert th...

In this paper we show that it can be tested in polynomial time whether a scenario is an execution of a Petri net. This holds for a wide variety of Petri net classes, ranging from elementary nets to general inhibitor nets. Scenarios are given by causal structures expressing causal dependencies and concurrency among events. In the case of elementary nets and of place/transition nets, such causal ...

Ordinary t-timed modular Petri Nets are used for modeling, analysis, synthesis and performance evaluation of random topology dedicated production systems. Each system is first decomposed into production line, assembly, disassembly and parallel machine modules followed by derivation of their modular Petri Net models. Two sets of modules, generic and generalized respectively, are derived correspo...

Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ACM synthesis method based on the generation of the reachability graph and the theory of regions was proposed. In this paper, we propose a new synthesis method based on the composition of Petri net modules, avoiding t...

Deadlock is the condition of a system that has reached a state in which all of its potential actions are blocked. This paper introduces a deadlock prevention method for discrete events systems modeled by Petri nets. Petri nets have a bipartite graph structure and they are particularly well suited to model concurrencies found in manufacturing, communication and computer systems, among others. Gi...

A genetic algorithm is used to learn a non-deterministic Petri netbased model of non-linear gene interactions, or statistical epistasis. Petri nets are computational models of concurrent processes. However, often certain global assumptions (e.g. transition priorities) are required in order to convert a non-deterministic Petri net into a simpler deterministic model for easier analysis and evalua...

System analysis is often needed with respect to both qualitative and quantitative aspects. In the last decades, several formalisms have been developed that attempt to combine these aspects in one description. Present emphasis is on Stochastic Petri Nets. Amongst others, one disadvantage of these formalisms lies with the diiculties when describing scheduling strategies with Petri Net elements. T...

Holonic manufacturing systems requires a robust and effective mechanism to reorganize available resources to cope with uncertainties to achieve the production goal. This paper combines the contract net protocol and Petri net to adaptively synthesize Petri net to control holonic manufacturing systems. The main results include: (1)a multi-agent model for holonic manufacturing systems based on con...