Petri nets and large finite sets (Q1060848): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parallel program schemata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rapidly growing Ramsey functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4138726 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3926596 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of the Finite Containment Problem for Petri Nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some independence results for Peano arithmetic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3931391 / rank | |||
Normal rank | |||
Latest revision as of 17:23, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Petri nets and large finite sets |
scientific article |
Statements
Petri nets and large finite sets (English)
0 references
1984
0 references
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 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.
0 references
models of arithmetic
0 references
upper bound
0 references
complexity of the Karp-Miller decision procedure
0 references
Finite Containment Problem for pairs of Petri nets
0 references
