22 search results - page 5 / 5 » When Is Reachability Intrinsically Decidable |
ALGORITHMICA
2002
13 years 5 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
APN
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...