{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FSU6KT6UCT4VREDDRRUGOYPXGA","short_pith_number":"pith:FSU6KT6U","schema_version":"1.0","canonical_sha256":"2ca9e54fd414f95890638c686761f730074096df8a7b16df9e35e8afea76f223","source":{"kind":"arxiv","id":"1409.3696","version":2},"attestation_state":"computed","paper":{"title":"LTL Parameter Synthesis of Parametric Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ivana \\v{C}ern\\'a, Ji\\v{r}\\'i Barnat, Nikola Bene\\v{s}, Peter Bezd\\v{e}k","submitted_at":"2014-09-12T10:53:32Z","abstract_excerpt":"The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL m"},"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":"1409.3696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-09-12T10:53:32Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e2441f754e076371903a6094246988ad38d0e9b931ebba06733879f9e688ed43","abstract_canon_sha256":"41867e498381a32c5de6b44a9967f9a164bb303793f5016cf5f48884e4837cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:38.988020Z","signature_b64":"birbHrIezfVQ/U986bL6pOweKUGcbNIFv7JHXbhQnfxP06DRstCoD/ii2wOuKjW2L3P+smRbuNhZI5s+WkNlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ca9e54fd414f95890638c686761f730074096df8a7b16df9e35e8afea76f223","last_reissued_at":"2026-05-18T01:19:38.987450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:38.987450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LTL Parameter Synthesis of Parametric Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ivana \\v{C}ern\\'a, Ji\\v{r}\\'i Barnat, Nikola Bene\\v{s}, Peter Bezd\\v{e}k","submitted_at":"2014-09-12T10:53:32Z","abstract_excerpt":"The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3696","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":"1409.3696","created_at":"2026-05-18T01:19:38.987546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3696v2","created_at":"2026-05-18T01:19:38.987546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3696","created_at":"2026-05-18T01:19:38.987546+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSU6KT6UCT4V","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSU6KT6UCT4VREDD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSU6KT6U","created_at":"2026-05-18T12:28:28.263976+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/FSU6KT6UCT4VREDDRRUGOYPXGA","json":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA.json","graph_json":"https://pith.science/api/pith-number/FSU6KT6UCT4VREDDRRUGOYPXGA/graph.json","events_json":"https://pith.science/api/pith-number/FSU6KT6UCT4VREDDRRUGOYPXGA/events.json","paper":"https://pith.science/paper/FSU6KT6U"},"agent_actions":{"view_html":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA","download_json":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA.json","view_paper":"https://pith.science/paper/FSU6KT6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3696&json=true","fetch_graph":"https://pith.science/api/pith-number/FSU6KT6UCT4VREDDRRUGOYPXGA/graph.json","fetch_events":"https://pith.science/api/pith-number/FSU6KT6UCT4VREDDRRUGOYPXGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA/action/storage_attestation","attest_author":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA/action/author_attestation","sign_citation":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA/action/citation_signature","submit_replication":"https://pith.science/pith/FSU6KT6UCT4VREDDRRUGOYPXGA/action/replication_record"}},"created_at":"2026-05-18T01:19:38.987546+00:00","updated_at":"2026-05-18T01:19:38.987546+00:00"}