{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HHO3DB3ZZOA24LOI33TG43TRVN","short_pith_number":"pith:HHO3DB3Z","schema_version":"1.0","canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","source":{"kind":"arxiv","id":"1510.05724","version":2},"attestation_state":"computed","paper":{"title":"Approaching the Coverability Problem Continuously","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Serge Haddad","submitted_at":"2015-10-20T00:02:48Z","abstract_excerpt":"The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstr"},"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":"1510.05724","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-10-20T00:02:48Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"35e70ccd252ad744793042384639534052b1326c14b91c0fad72a4b57b8bce2d","abstract_canon_sha256":"70506d8eb796f189d07605aaed4d786769929aa16ac0f473dac298e3a321a52e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.833306Z","signature_b64":"SrGga5PZRn7Lk0cGwYMYNYqeI9OnHYgZQOyu/ZGLzL4Z4mzAEgOWCCMS/PBH35Xo10luO0sDBeSm4JtVFAp8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ddb18779cb81ae2dc8dee66e6e71ab5ecec59b16a63ec0d942b0893136f9d4","last_reissued_at":"2026-05-18T00:48:05.832730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.832730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching the Coverability Problem Continuously","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Alain Finkel, Christoph Haase, Michael Blondin, Serge Haddad","submitted_at":"2015-10-20T00:02:48Z","abstract_excerpt":"The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05724","kind":"arxiv","version":2},"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":"1510.05724","created_at":"2026-05-18T00:48:05.832821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05724v2","created_at":"2026-05-18T00:48:05.832821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05724","created_at":"2026-05-18T00:48:05.832821+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHO3DB3ZZOA2","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHO3DB3ZZOA24LOI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHO3DB3Z","created_at":"2026-05-18T12:29:25.134429+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/HHO3DB3ZZOA24LOI33TG43TRVN","json":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN.json","graph_json":"https://pith.science/api/pith-number/HHO3DB3ZZOA24LOI33TG43TRVN/graph.json","events_json":"https://pith.science/api/pith-number/HHO3DB3ZZOA24LOI33TG43TRVN/events.json","paper":"https://pith.science/paper/HHO3DB3Z"},"agent_actions":{"view_html":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN","download_json":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN.json","view_paper":"https://pith.science/paper/HHO3DB3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05724&json=true","fetch_graph":"https://pith.science/api/pith-number/HHO3DB3ZZOA24LOI33TG43TRVN/graph.json","fetch_events":"https://pith.science/api/pith-number/HHO3DB3ZZOA24LOI33TG43TRVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/action/storage_attestation","attest_author":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/action/author_attestation","sign_citation":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/action/citation_signature","submit_replication":"https://pith.science/pith/HHO3DB3ZZOA24LOI33TG43TRVN/action/replication_record"}},"created_at":"2026-05-18T00:48:05.832821+00:00","updated_at":"2026-05-18T00:48:05.832821+00:00"}