For the most recent entries see the
Petri Nets Newsletter
.
Keyword: reachable marking
Esparza, Javier
:
A Polynomial Time Algorithm to Solve the Covering Problem for 1-Bounded Conflict-Free Petri Nets.
1991.
Howell, Rodney R.
:
The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets.
1991.
Gomm, Dominik
;
Walter, Rolf
:
The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets.
1990.
Colom, J.M.
;
Silva, M.
:
Improving the Linearly Based Characterization of P/T Nets.
1989.
de Frutos Escrig, D.
;
Johnen, C.
:
Decidability of Home Space Property.
1989.
Do you need a refined search? Try our
search engine
which allows complex field-based queries.
Back to the Petri Nets Bibliography