{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:EPOHV6QXJPVAHA52IUSSCKGDXP","short_pith_number":"pith:EPOHV6QX","schema_version":"1.0","canonical_sha256":"23dc7afa174bea0383ba45252128c3bbf27028986f7297b6a61fa59d48a8f076","source":{"kind":"arxiv","id":"0809.0060","version":3},"attestation_state":"computed","paper":{"title":"Model Checking Probabilistic Timed Automata with One or Two Clocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Francois Laroussinie, Jeremy Sproston, Marcin Jurdzinski","submitted_at":"2008-08-30T13:26:48Z","abstract_excerpt":"Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless of how nondeterminism is resolved) are PTIME-complete for one-clock probabilistic timed automata, and are EXPTIME-complete for probabilistic timed automata with two clocks. Secondly, we show that, for o"},"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":"0809.0060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-30T13:26:48Z","cross_cats_sorted":[],"title_canon_sha256":"3117eb508016635d433867d614857d92da16075f8936df996bd867ff890d48dc","abstract_canon_sha256":"2a66e6dc9145eea3b725b0633181c9fdab9e98c8beae4f0e910509d6dcb6f4bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.214078Z","signature_b64":"vzjI3MZj4NC6tDluZk+zs9TO5JNLQNzUJU38LG+67F6ahHa55beV8dRLxyW98XXMRtZMeUWXFHuUpzGeoZgXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23dc7afa174bea0383ba45252128c3bbf27028986f7297b6a61fa59d48a8f076","last_reissued_at":"2026-05-17T23:51:24.213576Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.213576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking Probabilistic Timed Automata with One or Two Clocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Francois Laroussinie, Jeremy Sproston, Marcin Jurdzinski","submitted_at":"2008-08-30T13:26:48Z","abstract_excerpt":"Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless of how nondeterminism is resolved) are PTIME-complete for one-clock probabilistic timed automata, and are EXPTIME-complete for probabilistic timed automata with two clocks. Secondly, we show that, for o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.0060","kind":"arxiv","version":3},"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":"0809.0060","created_at":"2026-05-17T23:51:24.213659+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.0060v3","created_at":"2026-05-17T23:51:24.213659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.0060","created_at":"2026-05-17T23:51:24.213659+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPOHV6QXJPVA","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPOHV6QXJPVAHA52","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPOHV6QX","created_at":"2026-05-18T12:25:57.157939+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/EPOHV6QXJPVAHA52IUSSCKGDXP","json":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP.json","graph_json":"https://pith.science/api/pith-number/EPOHV6QXJPVAHA52IUSSCKGDXP/graph.json","events_json":"https://pith.science/api/pith-number/EPOHV6QXJPVAHA52IUSSCKGDXP/events.json","paper":"https://pith.science/paper/EPOHV6QX"},"agent_actions":{"view_html":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP","download_json":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP.json","view_paper":"https://pith.science/paper/EPOHV6QX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.0060&json=true","fetch_graph":"https://pith.science/api/pith-number/EPOHV6QXJPVAHA52IUSSCKGDXP/graph.json","fetch_events":"https://pith.science/api/pith-number/EPOHV6QXJPVAHA52IUSSCKGDXP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP/action/storage_attestation","attest_author":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP/action/author_attestation","sign_citation":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP/action/citation_signature","submit_replication":"https://pith.science/pith/EPOHV6QXJPVAHA52IUSSCKGDXP/action/replication_record"}},"created_at":"2026-05-17T23:51:24.213659+00:00","updated_at":"2026-05-17T23:51:24.213659+00:00"}