{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:IYALWF67FMBTP3JEAINZTXQMM7","short_pith_number":"pith:IYALWF67","schema_version":"1.0","canonical_sha256":"4600bb17df2b0337ed24021b99de0c67f253d4fb4e046b2246cc3a795f520be8","source":{"kind":"arxiv","id":"cs/0611048","version":2},"attestation_state":"computed","paper":{"title":"Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Parosh Abdulla, Pritha Mahata, Richard Mayr","submitted_at":"2006-11-11T00:08:46Z","abstract_excerpt":"We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs. (i) Zenoness: whether there exists a zeno-computation from a given marking, i.e., an infinite computation which takes only a finite amount of time. We show decidability of zenoness for TPNs, thus solving an open problem from [Escrig et al.]. Furthermore, the related question if there exist arbitrarily"},"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":"cs/0611048","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-11-11T00:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"fa444499d4020ec436d623fcf5f8e6713f22f48e2f331c2c591d1f6513d9fc08","abstract_canon_sha256":"4fcdf12fc5254f2a2fdb49ee96f81f323a1f4b36957b4e3441cd2d7dfb8f4155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.282930Z","signature_b64":"TwUmOWlwRS5lmbrV6gD8b6bKglfvzH1z6jE9iqpKKf0xUP+vLbxaqWsiSLBNIapKHoVGynJyrylZBttYP3jqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4600bb17df2b0337ed24021b99de0c67f253d4fb4e046b2246cc3a795f520be8","last_reissued_at":"2026-05-18T00:53:03.282379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.282379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Parosh Abdulla, Pritha Mahata, Richard Mayr","submitted_at":"2006-11-11T00:08:46Z","abstract_excerpt":"We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs. (i) Zenoness: whether there exists a zeno-computation from a given marking, i.e., an infinite computation which takes only a finite amount of time. We show decidability of zenoness for TPNs, thus solving an open problem from [Escrig et al.]. Furthermore, the related question if there exist arbitrarily"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0611048","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":"cs/0611048","created_at":"2026-05-18T00:53:03.282463+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0611048v2","created_at":"2026-05-18T00:53:03.282463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0611048","created_at":"2026-05-18T00:53:03.282463+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYALWF67FMBT","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYALWF67FMBTP3JE","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYALWF67","created_at":"2026-05-18T12:25:54.717736+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/IYALWF67FMBTP3JEAINZTXQMM7","json":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7.json","graph_json":"https://pith.science/api/pith-number/IYALWF67FMBTP3JEAINZTXQMM7/graph.json","events_json":"https://pith.science/api/pith-number/IYALWF67FMBTP3JEAINZTXQMM7/events.json","paper":"https://pith.science/paper/IYALWF67"},"agent_actions":{"view_html":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7","download_json":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7.json","view_paper":"https://pith.science/paper/IYALWF67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0611048&json=true","fetch_graph":"https://pith.science/api/pith-number/IYALWF67FMBTP3JEAINZTXQMM7/graph.json","fetch_events":"https://pith.science/api/pith-number/IYALWF67FMBTP3JEAINZTXQMM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7/action/storage_attestation","attest_author":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7/action/author_attestation","sign_citation":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7/action/citation_signature","submit_replication":"https://pith.science/pith/IYALWF67FMBTP3JEAINZTXQMM7/action/replication_record"}},"created_at":"2026-05-18T00:53:03.282463+00:00","updated_at":"2026-05-18T00:53:03.282463+00:00"}