{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VIUED6STAN3BXDDWL6VQHJGD2I","short_pith_number":"pith:VIUED6ST","schema_version":"1.0","canonical_sha256":"aa2841fa5303761b8c765fab03a4c3d21c1de2b790d5a924542c6aa797074dee","source":{"kind":"arxiv","id":"1709.07171","version":8},"attestation_state":"computed","paper":{"title":"Computing Maximal Expected Termination Time of Probabilistic Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"David Rosenblum, Michael Fisher, Omar Al-Bataineh","submitted_at":"2017-09-21T06:21:15Z","abstract_excerpt":"The paper addresses the problem of computing maximal expected time to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually, terminate. This problem can exhibit high computational complexity, in particular when the automaton under analysis contains cycles that may be repeated very often (due to very high probabilities, e.g. p =0.999). Such cycles can degrade the performance of typical model checking algorithms, as the likelihood of repeating the cycle converges to zero arbitrarily slowly. We introduce an acceleration technique that can b"},"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":"1709.07171","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-21T06:21:15Z","cross_cats_sorted":[],"title_canon_sha256":"c6050139d4c0c76d3c4148741bb0d99b560c5bcc2c2da00d0c52847a2d7033dd","abstract_canon_sha256":"23e5f87f6205167d5ffdb711fec318bd357d1b71d52aa5ed2d22fd2f9f51c4d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:24.286098Z","signature_b64":"usvXQasM+rcbKLDg6V0xLsaWvhmnTHuKYTb+YSOtBdNUq/wqcLkqbw7WG/Wer6ivBKjOxTdPc9ZSxA9i40r5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2841fa5303761b8c765fab03a4c3d21c1de2b790d5a924542c6aa797074dee","last_reissued_at":"2026-05-18T00:20:24.285489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:24.285489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Maximal Expected Termination Time of Probabilistic Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"David Rosenblum, Michael Fisher, Omar Al-Bataineh","submitted_at":"2017-09-21T06:21:15Z","abstract_excerpt":"The paper addresses the problem of computing maximal expected time to termination of probabilistic timed automata (PTA) models, under the condition that the system will, eventually, terminate. This problem can exhibit high computational complexity, in particular when the automaton under analysis contains cycles that may be repeated very often (due to very high probabilities, e.g. p =0.999). Such cycles can degrade the performance of typical model checking algorithms, as the likelihood of repeating the cycle converges to zero arbitrarily slowly. We introduce an acceleration technique that can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07171","kind":"arxiv","version":8},"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":"1709.07171","created_at":"2026-05-18T00:20:24.285578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07171v8","created_at":"2026-05-18T00:20:24.285578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07171","created_at":"2026-05-18T00:20:24.285578+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIUED6STAN3B","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIUED6STAN3BXDDW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIUED6ST","created_at":"2026-05-18T12:31:49.984773+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/VIUED6STAN3BXDDWL6VQHJGD2I","json":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I.json","graph_json":"https://pith.science/api/pith-number/VIUED6STAN3BXDDWL6VQHJGD2I/graph.json","events_json":"https://pith.science/api/pith-number/VIUED6STAN3BXDDWL6VQHJGD2I/events.json","paper":"https://pith.science/paper/VIUED6ST"},"agent_actions":{"view_html":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I","download_json":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I.json","view_paper":"https://pith.science/paper/VIUED6ST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07171&json=true","fetch_graph":"https://pith.science/api/pith-number/VIUED6STAN3BXDDWL6VQHJGD2I/graph.json","fetch_events":"https://pith.science/api/pith-number/VIUED6STAN3BXDDWL6VQHJGD2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I/action/storage_attestation","attest_author":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I/action/author_attestation","sign_citation":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I/action/citation_signature","submit_replication":"https://pith.science/pith/VIUED6STAN3BXDDWL6VQHJGD2I/action/replication_record"}},"created_at":"2026-05-18T00:20:24.285578+00:00","updated_at":"2026-05-18T00:20:24.285578+00:00"}