{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BMDCFLT4GDYYPQ3EYEFYTCGVG7","short_pith_number":"pith:BMDCFLT4","schema_version":"1.0","canonical_sha256":"0b0622ae7c30f187c364c10b8988d537e5efc09d949ff26ce607d39cb1c129ff","source":{"kind":"arxiv","id":"1908.06633","version":1},"attestation_state":"computed","paper":{"title":"On the expressive power of invariants in parametric timed automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Didier Lime, \\'Etienne Andr\\'e, Mathias Ramparison","submitted_at":"2019-08-19T08:06:57Z","abstract_excerpt":"The verification of systems combining hard timing constraints with concurrency is challenging. This challenge becomes even harder when some timing constants are missing or unknown. Parametric timed formalisms, such as parametric timed automata (PTAs), tackle the synthesis of such timing constants (seen as parameters) for which a property holds. Such formalisms are highly expressive, but also undecidable, and few decidable subclasses were proposed. We propose here a syntactic restriction on PTAs consisting in removing guards (constraints on transitions) to keep only invariants (constraints on l"},"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":"1908.06633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-08-19T08:06:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"99a01a712a4fe87ca7ddc12e06a76bcbed0cbec6217e716474ba2cc6ba90e655","abstract_canon_sha256":"b5c1564a4a29ea741f2c8b9dacdb151bcad08409b0e6dcefc0203287cec014a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:17.828875Z","signature_b64":"2La9psW9lHVHVP/6Dl+rX45jpjJGL9T7rkTg4/KbfQjL/tb34nm6C5u/zfjhy/VnJzkJgx9PSJABhxp+U6z/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b0622ae7c30f187c364c10b8988d537e5efc09d949ff26ce607d39cb1c129ff","last_reissued_at":"2026-07-04T23:58:17.828500Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:17.828500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the expressive power of invariants in parametric timed automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Didier Lime, \\'Etienne Andr\\'e, Mathias Ramparison","submitted_at":"2019-08-19T08:06:57Z","abstract_excerpt":"The verification of systems combining hard timing constraints with concurrency is challenging. This challenge becomes even harder when some timing constants are missing or unknown. Parametric timed formalisms, such as parametric timed automata (PTAs), tackle the synthesis of such timing constants (seen as parameters) for which a property holds. Such formalisms are highly expressive, but also undecidable, and few decidable subclasses were proposed. We propose here a syntactic restriction on PTAs consisting in removing guards (constraints on transitions) to keep only invariants (constraints on l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06633","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06633/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06633","created_at":"2026-07-04T23:58:17.828564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06633v1","created_at":"2026-07-04T23:58:17.828564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06633","created_at":"2026-07-04T23:58:17.828564+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMDCFLT4GDYY","created_at":"2026-07-04T23:58:17.828564+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMDCFLT4GDYYPQ3E","created_at":"2026-07-04T23:58:17.828564+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMDCFLT4","created_at":"2026-07-04T23:58:17.828564+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/BMDCFLT4GDYYPQ3EYEFYTCGVG7","json":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7.json","graph_json":"https://pith.science/api/pith-number/BMDCFLT4GDYYPQ3EYEFYTCGVG7/graph.json","events_json":"https://pith.science/api/pith-number/BMDCFLT4GDYYPQ3EYEFYTCGVG7/events.json","paper":"https://pith.science/paper/BMDCFLT4"},"agent_actions":{"view_html":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7","download_json":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7.json","view_paper":"https://pith.science/paper/BMDCFLT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06633&json=true","fetch_graph":"https://pith.science/api/pith-number/BMDCFLT4GDYYPQ3EYEFYTCGVG7/graph.json","fetch_events":"https://pith.science/api/pith-number/BMDCFLT4GDYYPQ3EYEFYTCGVG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7/action/storage_attestation","attest_author":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7/action/author_attestation","sign_citation":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7/action/citation_signature","submit_replication":"https://pith.science/pith/BMDCFLT4GDYYPQ3EYEFYTCGVG7/action/replication_record"}},"created_at":"2026-07-04T23:58:17.828564+00:00","updated_at":"2026-07-04T23:58:17.828564+00:00"}