Petri nets and large finite sets

  • McAloon K
  • 2


    Mendeley users who have this article in their library.
  • 36


    Citations of this article.


An upper bound is given for the complexity of the Karp-Miller decision procedure for the Finite Containment Problem for pairs of Petri nets; the procedure is shown to be primitive recursive in the Ackermann function. Bounds for the lengths of the searches involved are obtained in terms of large finite sets in the sense of Paris-Harrington and of Ketonen-Solovay. © 1984.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Kenneth McAloon

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free