{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NQAX5HWQJW6V53BPHKTBIX44GC","short_pith_number":"pith:NQAX5HWQ","schema_version":"1.0","canonical_sha256":"6c017e9ed04dbd5eec2f3aa6145f9c308d00333a7d172a837d4363deb692dfdb","source":{"kind":"arxiv","id":"1011.0219","version":1},"attestation_state":"computed","paper":{"title":"On Zone-Based Analysis of Duration Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Bruce H. Krogh (Department of EC Carnegie Mellon University, CS Aalborg University, Denmark), France), Kim G. Larsen (CISS, Oded Maler (CNRS-VERIMAG, University of Grenoble, USA)","submitted_at":"2010-11-01T00:18:56Z","abstract_excerpt":"We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA), expressing multiple parallel processes admitting memoryfull continuously-distributed  durations. For this model we develop an extension of the zone-based forward reachability algorithm whose successor operator is a density transformer, thus providing a solution to verification and performance evaluation problems concerning acyclic DPA (or the bounded-horizon behavi"},"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":"1011.0219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-01T00:18:56Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"06a8a2a75832d3abbdc7d2528117ca99d01beef744dfed4af4f3cd1b7bf4337c","abstract_canon_sha256":"50f3285d9942628e11e18fa311ac439dba797561fc61546b8e428620cd2608e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:30.344861Z","signature_b64":"WJ3GFvRkQlaIdSa0gHgfJkgyu1R2uqBxQrG9+lI28r84cymLpd7aIHPpgOQV8QnWkRt5uoe3ErEhYuoaggd0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c017e9ed04dbd5eec2f3aa6145f9c308d00333a7d172a837d4363deb692dfdb","last_reissued_at":"2026-05-18T04:37:30.344159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:30.344159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Zone-Based Analysis of Duration Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Bruce H. Krogh (Department of EC Carnegie Mellon University, CS Aalborg University, Denmark), France), Kim G. Larsen (CISS, Oded Maler (CNRS-VERIMAG, University of Grenoble, USA)","submitted_at":"2010-11-01T00:18:56Z","abstract_excerpt":"We propose an extension of the zone-based algorithmics for analyzing timed automata to handle systems where timing uncertainty is considered as probabilistic rather than set-theoretic. We study duration probabilistic automata (DPA), expressing multiple parallel processes admitting memoryfull continuously-distributed  durations. For this model we develop an extension of the zone-based forward reachability algorithm whose successor operator is a density transformer, thus providing a solution to verification and performance evaluation problems concerning acyclic DPA (or the bounded-horizon behavi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0219","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":"1011.0219","created_at":"2026-05-18T04:37:30.344265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0219v1","created_at":"2026-05-18T04:37:30.344265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0219","created_at":"2026-05-18T04:37:30.344265+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQAX5HWQJW6V","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQAX5HWQJW6V53BP","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQAX5HWQ","created_at":"2026-05-18T12:26:10.704358+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/NQAX5HWQJW6V53BPHKTBIX44GC","json":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC.json","graph_json":"https://pith.science/api/pith-number/NQAX5HWQJW6V53BPHKTBIX44GC/graph.json","events_json":"https://pith.science/api/pith-number/NQAX5HWQJW6V53BPHKTBIX44GC/events.json","paper":"https://pith.science/paper/NQAX5HWQ"},"agent_actions":{"view_html":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC","download_json":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC.json","view_paper":"https://pith.science/paper/NQAX5HWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0219&json=true","fetch_graph":"https://pith.science/api/pith-number/NQAX5HWQJW6V53BPHKTBIX44GC/graph.json","fetch_events":"https://pith.science/api/pith-number/NQAX5HWQJW6V53BPHKTBIX44GC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC/action/storage_attestation","attest_author":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC/action/author_attestation","sign_citation":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC/action/citation_signature","submit_replication":"https://pith.science/pith/NQAX5HWQJW6V53BPHKTBIX44GC/action/replication_record"}},"created_at":"2026-05-18T04:37:30.344265+00:00","updated_at":"2026-05-18T04:37:30.344265+00:00"}