2 search results - page 1 / 1 » Analyzing Reachability for Some Petri Nets With Fast Growing... |
ENTCS
2008
13 years 4 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
APN
2004
Springer
13 years 10 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...