Sciweavers

941 search results - page 3 / 189
» History-Dependent Petri Nets
Sort
View
64
Voted
INFSOF
2002
85views more  INFSOF 2002»
14 years 9 months ago
A methodology of testing high-level Petri nets
Petri nets have been extensively used in the modelling and analysis of concurrent and distributed systems. The veri
Hong Zhu, Xudong He
MFCS
2010
Springer
14 years 8 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
95
Voted
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 1 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
160
Voted
AUTOMATICA
2011
14 years 4 months ago
Timing and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
Carlos Renato Vázquez, Manuel Silva