{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X23JI236TKEPVBZG4XHIRDTALG","short_pith_number":"pith:X23JI236","schema_version":"1.0","canonical_sha256":"beb6946b7e9a88fa8726e5ce888e6059891e36ed287745ba05e7161aa1829b22","source":{"kind":"arxiv","id":"2605.16959","version":1},"attestation_state":"computed","paper":{"title":"Over-approximation of weakly-hard constraints for control systems verification (Extended)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A compressed language acceptor over-approximates weakly-hard deadline-miss constraints while simulating the original finite-state machine, enabling safety verification for control systems where exact models are too large.","cross_cats":["cs.FL","cs.SY"],"primary_cat":"eess.SY","authors_text":"Holger Hermanns, Martina Maggio, Rieke de Maeyer","submitted_at":"2026-05-16T12:21:58Z","abstract_excerpt":"A hard real-time system cannot miss any deadline. A weakly-hard real-time system, on the contrary, is designed to tolerate a specific number of deadline misses. For instance, the AnyMiss(2, 300) weakly-hard constraint stipulates that in every window of 300 consecutive jobs, at most 2 deadlines are missed. The weakly-hard model is the state-of-the-art for industrial dependability-by-design of control systems that tolerate deterministic failures. Weakly-hard constraints correspond to regular languages. The size of the minimal finite state machine that recognizes whether a string satisfies the co"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.16959","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2026-05-16T12:21:58Z","cross_cats_sorted":["cs.FL","cs.SY"],"title_canon_sha256":"f8052a9cea0953f55d53babaef10122f63b598c85cfad6a35d07d60a020518ab","abstract_canon_sha256":"130d0531ed818bf9fad08807cd040353741a5a6b0c3463dc8505d4acd8b56df4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:32.925696Z","signature_b64":"U1C+3FGjZ4sSRMPLFPIbUCYDMpCDVvYtXkhE6QRmYlBKMtMlKpg8QIlMvMGHXTAyhOp4TnGkKWWJ2RTFLZ3lBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb6946b7e9a88fa8726e5ce888e6059891e36ed287745ba05e7161aa1829b22","last_reissued_at":"2026-05-20T00:03:32.924924Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:32.924924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Over-approximation of weakly-hard constraints for control systems verification (Extended)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A compressed language acceptor over-approximates weakly-hard deadline-miss constraints while simulating the original finite-state machine, enabling safety verification for control systems where exact models are too large.","cross_cats":["cs.FL","cs.SY"],"primary_cat":"eess.SY","authors_text":"Holger Hermanns, Martina Maggio, Rieke de Maeyer","submitted_at":"2026-05-16T12:21:58Z","abstract_excerpt":"A hard real-time system cannot miss any deadline. A weakly-hard real-time system, on the contrary, is designed to tolerate a specific number of deadline misses. For instance, the AnyMiss(2, 300) weakly-hard constraint stipulates that in every window of 300 consecutive jobs, at most 2 deadlines are missed. The weakly-hard model is the state-of-the-art for industrial dependability-by-design of control systems that tolerate deterministic failures. Weakly-hard constraints correspond to regular languages. The size of the minimal finite state machine that recognizes whether a string satisfies the co"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a compressed language acceptor and prove that it simulates the original finite state machine. We study language cardinality properties, and report on empirical results that show how the new acceptor can be embedded in the control design workflow, leading to verifying safety for systems for which the state-of-the-art tools do not provide answers.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The over-approximation remains sufficiently tight to yield useful (non-vacuous) safety guarantees when embedded in the control design workflow (abstract).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Presents a compressed acceptor that simulates the minimal FSM for weakly-hard constraints and supports sound safety verification in control design workflows.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A compressed language acceptor over-approximates weakly-hard deadline-miss constraints while simulating the original finite-state machine, enabling safety verification for control systems where exact models are too large.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bc8fadd40da144ae69a626f42e0abe0c06d10c471236843d9a5b8da6b0345c08"},"source":{"id":"2605.16959","kind":"arxiv","version":1},"verdict":{"id":"7405bacc-7e52-4d6f-a8f3-d61392034fa3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:10:50.998774Z","strongest_claim":"We present a compressed language acceptor and prove that it simulates the original finite state machine. We study language cardinality properties, and report on empirical results that show how the new acceptor can be embedded in the control design workflow, leading to verifying safety for systems for which the state-of-the-art tools do not provide answers.","one_line_summary":"Presents a compressed acceptor that simulates the minimal FSM for weakly-hard constraints and supports sound safety verification in control design workflows.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The over-approximation remains sufficiently tight to yield useful (non-vacuous) safety guarantees when embedded in the control design workflow (abstract).","pith_extraction_headline":"A compressed language acceptor over-approximates weakly-hard deadline-miss constraints while simulating the original finite-state machine, enabling safety verification for control systems where exact models are too large."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16959/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.066960Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:21:39.920996Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T19:51:58.351227Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T19:50:16.115010Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.232077Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.316886Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"808a4bb19fcab97301c0e53b430a9f31301bff3d344ec5e90aebcd2375553ca6"},"references":{"count":37,"sample":[{"doi":"","year":2018,"title":"Verifying weakly-hard real-time properties of traffic streams in switched networks","work_id":"bcc3da5a-deb3-4557-8090-08b85692af8b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Benny Akesson, Mitra Nasri, Geoffrey Nelissen, Sebastian Altmeyer, and Robert I. Davis. An empirical survey-based study into industry practice in real-time systems. InIEEE Real-Time Systems Symposium,","work_id":"460980c5-156b-44ae-a611-605a4362e439","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"ISA - The Instru- mentation, Systems and Automation Society, 2006","work_id":"818416df-cfa9-4752-b1c5-7ba778d6be9f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"K.J. Åström and B. Wittenmark.Computer-Controlled Systems: Theory and De- sign, Third Edition. Dover Books on Electrical Engineering. Dover Publications, 2011","work_id":"94a9653b-2453-4b3b-ad1c-0127317059b2","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"G. Bernat, A. Burns, and A. Liamosi. Weakly hard real-time systems.IEEE Transactions on Computers, 50(4):308–321, 2001","work_id":"57fafdf2-1fe6-46a5-bd05-9c35527da565","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"b94a1e2c7c4dad9ac004a9eb29a94f0d3136d41ce66f2f6ac9166dd10ad1a38a","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":"2605.16959","created_at":"2026-05-20T00:03:32.925050+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16959v1","created_at":"2026-05-20T00:03:32.925050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16959","created_at":"2026-05-20T00:03:32.925050+00:00"},{"alias_kind":"pith_short_12","alias_value":"X23JI236TKEP","created_at":"2026-05-20T00:03:32.925050+00:00"},{"alias_kind":"pith_short_16","alias_value":"X23JI236TKEPVBZG","created_at":"2026-05-20T00:03:32.925050+00:00"},{"alias_kind":"pith_short_8","alias_value":"X23JI236","created_at":"2026-05-20T00:03:32.925050+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/X23JI236TKEPVBZG4XHIRDTALG","json":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG.json","graph_json":"https://pith.science/api/pith-number/X23JI236TKEPVBZG4XHIRDTALG/graph.json","events_json":"https://pith.science/api/pith-number/X23JI236TKEPVBZG4XHIRDTALG/events.json","paper":"https://pith.science/paper/X23JI236"},"agent_actions":{"view_html":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG","download_json":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG.json","view_paper":"https://pith.science/paper/X23JI236","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16959&json=true","fetch_graph":"https://pith.science/api/pith-number/X23JI236TKEPVBZG4XHIRDTALG/graph.json","fetch_events":"https://pith.science/api/pith-number/X23JI236TKEPVBZG4XHIRDTALG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG/action/storage_attestation","attest_author":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG/action/author_attestation","sign_citation":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG/action/citation_signature","submit_replication":"https://pith.science/pith/X23JI236TKEPVBZG4XHIRDTALG/action/replication_record"}},"created_at":"2026-05-20T00:03:32.925050+00:00","updated_at":"2026-05-20T00:03:32.925050+00:00"}