For the most recent entries see the
Petri Nets Newsletter.
A concise proof of the coverability theorem for live and boundness extended free choice nets.
Kovalyov, Andrei
In:
Petri Net Newsletter No. 56, pages 1-6.
April 1999.
Abstract:
The known proofs of the well-known coverability theorem for free-choice
nets consider system behavior, (firing sequences or processes) and thus
seem a bit long.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Back to the Petri Nets Bibliography