357 search results - page 2 / 72 » On the Model of Computation of Place Transition Petri Nets |
BIRTHDAY
2008
Springer
13 years 7 months ago
2008
Springer
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...
ENTCS
2002
13 years 5 months ago
2002
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
FUIN
2008
13 years 5 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
FUIN
2007
13 years 5 months ago
2007
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
AUTOMATICA
2004
13 years 5 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...