Petri nets and large finite sets

36Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

McAloon, K. (1984). Petri nets and large finite sets. Theoretical Computer Science, 32(1–2), 173–183. https://doi.org/10.1016/0304-3975(84)90029-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free