Sciweavers

9 search results - page 1 / 2
» Comparison of the Expressiveness of Arc, Place and Transitio...
Sort
View
FUIN
2008
94views more  FUIN 2008»
13 years 11 months ago
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
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 ...
Marc Boyer, Olivier H. Roux
ENTCS
2002
103views more  ENTCS 2002»
13 years 11 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
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, ...
Marc Boyer
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 2 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
Parosh Aziz Abdulla, Richard Mayr
JCSS
2010
111views more  JCSS 2010»
13 years 9 months ago
Reduction rules for reset/inhibitor nets
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...