{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:O25T4ZHXQ6SSWG3ABEI4NJVAZH","short_pith_number":"pith:O25T4ZHX","schema_version":"1.0","canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","source":{"kind":"arxiv","id":"1011.3964","version":1},"attestation_state":"computed","paper":{"title":"Decision Problems for Petri Nets with Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David de Frutos-Escrig, Fernando Rosa-Velardo","submitted_at":"2010-11-17T14:11:53Z","abstract_excerpt":"We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1011.3964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-11-17T14:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"e6b015814b79915b96710c7a9cfb73d6a18cc1d48cb2a4de9a90bfb39e7ed9c2","abstract_canon_sha256":"89959bdf0194f00993dddfccbcf5291fabc666e12db05f9732d0926620e1c6d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:47.304173Z","signature_b64":"FEXeg1PAR7Dug71IL/yYphoF2sWKBk9fLlzqnsZPteamYkfBLLG1Ygxiw0MgHmi5pe1cDlYRDMIMS6NSQEM0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76bb3e64f787a52b1b600911c6a6a0c9c55831cc7eefd522b54a77d52901f2e3","last_reissued_at":"2026-05-18T04:35:47.303596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:47.303596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decision Problems for Petri Nets with Names","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David de Frutos-Escrig, Fernando Rosa-Velardo","submitted_at":"2010-11-17T14:11:53Z","abstract_excerpt":"We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3964","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.3964","created_at":"2026-05-18T04:35:47.303667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3964v1","created_at":"2026-05-18T04:35:47.303667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3964","created_at":"2026-05-18T04:35:47.303667+00:00"},{"alias_kind":"pith_short_12","alias_value":"O25T4ZHXQ6SS","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"O25T4ZHXQ6SSWG3A","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"O25T4ZHX","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH","json":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH.json","graph_json":"https://pith.science/api/pith-number/O25T4ZHXQ6SSWG3ABEI4NJVAZH/graph.json","events_json":"https://pith.science/api/pith-number/O25T4ZHXQ6SSWG3ABEI4NJVAZH/events.json","paper":"https://pith.science/paper/O25T4ZHX"},"agent_actions":{"view_html":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH","download_json":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH.json","view_paper":"https://pith.science/paper/O25T4ZHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3964&json=true","fetch_graph":"https://pith.science/api/pith-number/O25T4ZHXQ6SSWG3ABEI4NJVAZH/graph.json","fetch_events":"https://pith.science/api/pith-number/O25T4ZHXQ6SSWG3ABEI4NJVAZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/action/storage_attestation","attest_author":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/action/author_attestation","sign_citation":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/action/citation_signature","submit_replication":"https://pith.science/pith/O25T4ZHXQ6SSWG3ABEI4NJVAZH/action/replication_record"}},"created_at":"2026-05-18T04:35:47.303667+00:00","updated_at":"2026-05-18T04:35:47.303667+00:00"}