{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7DKD3HE6LD3R3SSAQ2M2KBMVYX","short_pith_number":"pith:7DKD3HE6","schema_version":"1.0","canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","source":{"kind":"arxiv","id":"1211.6194","version":1},"attestation_state":"computed","paper":{"title":"A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Alexandre David, Ji\\v{r}\\'i Srba, Lasse Jacobsen, Morten Jacobsen","submitted_at":"2012-11-27T02:37:14Z","abstract_excerpt":"Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof of its correctness, including reduction techniques based on symmetries and extrapolation. Finally, we augment the algorithm with a novel state-space reduction technique introducing a monotonic ordering on markings and prove its soundness ev"},"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":"1211.6194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-27T02:37:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1363b7a5bab5edc82b803450c1d946910b60bf2a1a9378fbb965cbfe3c0c29ec","abstract_canon_sha256":"4b54d9673396d3c330b3bf30af1d98a6abddd2c7fb815e37b20d161951d8a3d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:52.301249Z","signature_b64":"XMrB3v1T3m1IUftLPmdelGRwkcwKsGez7z4qw8HlZApMey+3d8JdQpZLWA3qKAgFwL6WZ5F3ekkn/V6VAheIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d43d9c9e58f71dca408699a50595c5ea64261794b1ea8caacda22af92b938f","last_reissued_at":"2026-05-18T03:39:52.300828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:52.300828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LO","authors_text":"Alexandre David, Ji\\v{r}\\'i Srba, Lasse Jacobsen, Morten Jacobsen","submitted_at":"2012-11-27T02:37:14Z","abstract_excerpt":"Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof of its correctness, including reduction techniques based on symmetries and extrapolation. Finally, we augment the algorithm with a novel state-space reduction technique introducing a monotonic ordering on markings and prove its soundness ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6194","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":"1211.6194","created_at":"2026-05-18T03:39:52.300891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.6194v1","created_at":"2026-05-18T03:39:52.300891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6194","created_at":"2026-05-18T03:39:52.300891+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DKD3HE6LD3R","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DKD3HE6LD3R3SSA","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DKD3HE6","created_at":"2026-05-18T12:26:56.085431+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/7DKD3HE6LD3R3SSAQ2M2KBMVYX","json":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX.json","graph_json":"https://pith.science/api/pith-number/7DKD3HE6LD3R3SSAQ2M2KBMVYX/graph.json","events_json":"https://pith.science/api/pith-number/7DKD3HE6LD3R3SSAQ2M2KBMVYX/events.json","paper":"https://pith.science/paper/7DKD3HE6"},"agent_actions":{"view_html":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX","download_json":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX.json","view_paper":"https://pith.science/paper/7DKD3HE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.6194&json=true","fetch_graph":"https://pith.science/api/pith-number/7DKD3HE6LD3R3SSAQ2M2KBMVYX/graph.json","fetch_events":"https://pith.science/api/pith-number/7DKD3HE6LD3R3SSAQ2M2KBMVYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/action/storage_attestation","attest_author":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/action/author_attestation","sign_citation":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/action/citation_signature","submit_replication":"https://pith.science/pith/7DKD3HE6LD3R3SSAQ2M2KBMVYX/action/replication_record"}},"created_at":"2026-05-18T03:39:52.300891+00:00","updated_at":"2026-05-18T03:39:52.300891+00:00"}