{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P3RFAWMC7ZPALTVH3KUUYYVXOO","short_pith_number":"pith:P3RFAWMC","schema_version":"1.0","canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","source":{"kind":"arxiv","id":"1806.08170","version":1},"attestation_state":"computed","paper":{"title":"Universal Safety for Timed Petri Nets is PSPACE-complete","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mohamed Faouzi Atig, Parosh Aziz Abdulla, Patrick Totzke, Radu Ciobanu, Richard Mayr","submitted_at":"2018-06-21T11:12:10Z","abstract_excerpt":"A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. We consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network.\n  This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number $m$ of tokens, such that "},"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":"1806.08170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-21T11:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"62637e1f29966399892c5b233e55c235fa8df36600b303249469749380e78a89","abstract_canon_sha256":"4945635050fd7444b5965bee084e35d2e0a6be6dc503963f280e20b80ee0b7c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.803083Z","signature_b64":"WVGIoZNchRniNFzJxh/XIt6bGTBHnvBHn11CJ7Brt5WAOAQ6dm+LtGMh2XMv+97InWQz9lYLPPDr6DWUWF1UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ee2505982fe5e05cea7daa94c62b773be7e6a23e2c93284062449622d32d326","last_reissued_at":"2026-05-18T00:12:41.802573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.802573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Safety for Timed Petri Nets is PSPACE-complete","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mohamed Faouzi Atig, Parosh Aziz Abdulla, Patrick Totzke, Radu Ciobanu, Richard Mayr","submitted_at":"2018-06-21T11:12:10Z","abstract_excerpt":"A timed network consists of an arbitrary number of initially identical 1-clock timed automata, interacting via hand-shake communication. In this setting there is no unique central controller, since all automata are initially identical. We consider the universal safety problem for such controller-less timed networks, i.e., verifying that a bad event (enabling some given transition) is impossible regardless of the size of the network.\n  This universal safety problem is dual to the existential coverability problem for timed-arc Petri nets, i.e., does there exist a number $m$ of tokens, such that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08170","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":"1806.08170","created_at":"2026-05-18T00:12:41.802653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08170v1","created_at":"2026-05-18T00:12:41.802653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08170","created_at":"2026-05-18T00:12:41.802653+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3RFAWMC7ZPA","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3RFAWMC7ZPALTVH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3RFAWMC","created_at":"2026-05-18T12:32:43.782077+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/P3RFAWMC7ZPALTVH3KUUYYVXOO","json":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO.json","graph_json":"https://pith.science/api/pith-number/P3RFAWMC7ZPALTVH3KUUYYVXOO/graph.json","events_json":"https://pith.science/api/pith-number/P3RFAWMC7ZPALTVH3KUUYYVXOO/events.json","paper":"https://pith.science/paper/P3RFAWMC"},"agent_actions":{"view_html":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO","download_json":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO.json","view_paper":"https://pith.science/paper/P3RFAWMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08170&json=true","fetch_graph":"https://pith.science/api/pith-number/P3RFAWMC7ZPALTVH3KUUYYVXOO/graph.json","fetch_events":"https://pith.science/api/pith-number/P3RFAWMC7ZPALTVH3KUUYYVXOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/action/storage_attestation","attest_author":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/action/author_attestation","sign_citation":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/action/citation_signature","submit_replication":"https://pith.science/pith/P3RFAWMC7ZPALTVH3KUUYYVXOO/action/replication_record"}},"created_at":"2026-05-18T00:12:41.802653+00:00","updated_at":"2026-05-18T00:12:41.802653+00:00"}