{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:STS3EEEJ6EZK4FBHK5SN2GEQ76","short_pith_number":"pith:STS3EEEJ","schema_version":"1.0","canonical_sha256":"94e5b21089f132ae14275764dd1890ff847e9cd15a0732df17c93e4322a9794f","source":{"kind":"arxiv","id":"1410.2128","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christel Baier (Technische Universit\\\"at Dresden), Marcin Jurdzinski (University of Warwick), Marcus Groesser (Technische Universit\\\"at Dresden), Nathalie Bertrand (INRIA Rennes - Bretagne Atlantique), Patricia Bouyer (LSV & ENS Cachan), Quentin Menet (Universit\\'e de Mons), Thomas Brihaye (Universit\\'e de Mons)","submitted_at":"2014-10-08T14:15:01Z","abstract_excerpt":"A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a stochastic timed automaton A and a property $\\Phi$, we want to decide whether A satisfies $\\Phi$ with probability 1. In this paper, we identify several classes of automata and of properties for which this can be decided. The proof relies on the construction of a finite abstraction, called the thick graph, that we interpret as a finite Markov chain, and for which we "},"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":"1410.2128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-08T14:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"34583725572399f9c00fc89438825538921812cecf11327091fb62af74e6eafb","abstract_canon_sha256":"2b76f91ac15a40f4ae009c955a335fcfb5a372cea587e9d83bbeaff2ef71c6d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.543553Z","signature_b64":"XzQPYfmXuS+jsSO/dkRn9/vSnkSdlRciBidFhpo5+oJb13gP8t9dHBbGNqNQNeB0Zi0VSXSx1lEwARbVyjqXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94e5b21089f132ae14275764dd1890ff847e9cd15a0732df17c93e4322a9794f","last_reissued_at":"2026-05-18T01:37:35.543063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.543063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christel Baier (Technische Universit\\\"at Dresden), Marcin Jurdzinski (University of Warwick), Marcus Groesser (Technische Universit\\\"at Dresden), Nathalie Bertrand (INRIA Rennes - Bretagne Atlantique), Patricia Bouyer (LSV & ENS Cachan), Quentin Menet (Universit\\'e de Mons), Thomas Brihaye (Universit\\'e de Mons)","submitted_at":"2014-10-08T14:15:01Z","abstract_excerpt":"A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a stochastic timed automaton A and a property $\\Phi$, we want to decide whether A satisfies $\\Phi$ with probability 1. In this paper, we identify several classes of automata and of properties for which this can be decided. The proof relies on the construction of a finite abstraction, called the thick graph, that we interpret as a finite Markov chain, and for which we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2128","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":"1410.2128","created_at":"2026-05-18T01:37:35.543132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2128v2","created_at":"2026-05-18T01:37:35.543132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2128","created_at":"2026-05-18T01:37:35.543132+00:00"},{"alias_kind":"pith_short_12","alias_value":"STS3EEEJ6EZK","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"STS3EEEJ6EZK4FBH","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"STS3EEEJ","created_at":"2026-05-18T12:28:49.207871+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/STS3EEEJ6EZK4FBHK5SN2GEQ76","json":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76.json","graph_json":"https://pith.science/api/pith-number/STS3EEEJ6EZK4FBHK5SN2GEQ76/graph.json","events_json":"https://pith.science/api/pith-number/STS3EEEJ6EZK4FBHK5SN2GEQ76/events.json","paper":"https://pith.science/paper/STS3EEEJ"},"agent_actions":{"view_html":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76","download_json":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76.json","view_paper":"https://pith.science/paper/STS3EEEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2128&json=true","fetch_graph":"https://pith.science/api/pith-number/STS3EEEJ6EZK4FBHK5SN2GEQ76/graph.json","fetch_events":"https://pith.science/api/pith-number/STS3EEEJ6EZK4FBHK5SN2GEQ76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76/action/storage_attestation","attest_author":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76/action/author_attestation","sign_citation":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76/action/citation_signature","submit_replication":"https://pith.science/pith/STS3EEEJ6EZK4FBHK5SN2GEQ76/action/replication_record"}},"created_at":"2026-05-18T01:37:35.543132+00:00","updated_at":"2026-05-18T01:37:35.543132+00:00"}