{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DPVOPZFPKHX6JXSAD7XVZOYT2G","short_pith_number":"pith:DPVOPZFP","schema_version":"1.0","canonical_sha256":"1beae7e4af51efe4de401fef5cbb13d18f980f65859375d1c31883cf8f3c46b6","source":{"kind":"arxiv","id":"1107.1166","version":1},"attestation_state":"computed","paper":{"title":"Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Carlo Bellettini, Lorenzo Capra","submitted_at":"2011-07-06T15:52:36Z","abstract_excerpt":"We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real- time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. The technique consists of building a symbolic reachability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly infinite) reachability-tree. The graph construction algorithm has been automated by a"},"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":"1107.1166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-07-06T15:52:36Z","cross_cats_sorted":[],"title_canon_sha256":"d06729391a99484d33255f9f696df91534b01814d3a1b3cd88b2d79a04c710bd","abstract_canon_sha256":"09ac3fe1526652a2195301670649d916b2e9547e2382f7edd78b60ca277fab98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:45.443582Z","signature_b64":"Gski+946zzdBPW39Z7I/1aaVx7OBWclmd/g2akIL/1nuimkI5v9aocCnEKwenLCMdcHP1JA8vU/O+jzByaMCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1beae7e4af51efe4de401fef5cbb13d18f980f65859375d1c31883cf8f3c46b6","last_reissued_at":"2026-05-18T04:18:45.442478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:45.442478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Carlo Bellettini, Lorenzo Capra","submitted_at":"2011-07-06T15:52:36Z","abstract_excerpt":"We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real- time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. The technique consists of building a symbolic reachability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly infinite) reachability-tree. The graph construction algorithm has been automated by a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1166","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":"1107.1166","created_at":"2026-05-18T04:18:45.442618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1166v1","created_at":"2026-05-18T04:18:45.442618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1166","created_at":"2026-05-18T04:18:45.442618+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPVOPZFPKHX6","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPVOPZFPKHX6JXSA","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPVOPZFP","created_at":"2026-05-18T12:26:26.731475+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/DPVOPZFPKHX6JXSAD7XVZOYT2G","json":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G.json","graph_json":"https://pith.science/api/pith-number/DPVOPZFPKHX6JXSAD7XVZOYT2G/graph.json","events_json":"https://pith.science/api/pith-number/DPVOPZFPKHX6JXSAD7XVZOYT2G/events.json","paper":"https://pith.science/paper/DPVOPZFP"},"agent_actions":{"view_html":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G","download_json":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G.json","view_paper":"https://pith.science/paper/DPVOPZFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1166&json=true","fetch_graph":"https://pith.science/api/pith-number/DPVOPZFPKHX6JXSAD7XVZOYT2G/graph.json","fetch_events":"https://pith.science/api/pith-number/DPVOPZFPKHX6JXSAD7XVZOYT2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G/action/storage_attestation","attest_author":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G/action/author_attestation","sign_citation":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G/action/citation_signature","submit_replication":"https://pith.science/pith/DPVOPZFPKHX6JXSAD7XVZOYT2G/action/replication_record"}},"created_at":"2026-05-18T04:18:45.442618+00:00","updated_at":"2026-05-18T04:18:45.442618+00:00"}