22 search results - page 1 / 5 » Reachability in Petri Nets with Inhibitor Arcs |
ENTCS
2008
13 years 5 months ago
2008
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
PNPM
1987
13 years 8 months ago
1987
Some insight on the meaning of "modeling power" for Stochastic Petri Net models is given. Extensions characterizing a Stochastic Petri Net are categorized as logical or ...
APN
1993
Springer
13 years 9 months ago
1993
Springer
In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives—place capacities, test arcs and inhibitor arcs. The new modelling primitiv...