{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JVUTYZB42X2VHZGXRJYLF7GA3X","short_pith_number":"pith:JVUTYZB4","schema_version":"1.0","canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","source":{"kind":"arxiv","id":"1604.08004","version":1},"attestation_state":"computed","paper":{"title":"An Analytical Solution for Probabilistic Guarantees of Reservation Based Soft Real-Time Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Bernardo Villalba Fr\\'ias, Daniele Fontanelli, Luca Abeni, Luigi Palopoli","submitted_at":"2016-04-27T10:08:53Z","abstract_excerpt":"We show a methodology for the computation of the probability of deadline miss for a periodic real-time task scheduled by a resource reservation algorithm. We propose a modelling technique for the system that reduces the computation of such a probability to that of the steady state probability of an infinite state Discrete Time Markov Chain with a periodic structure. This structure is exploited to develop an efficient numeric solution where different accuracy/computation time trade-offs can be obtained by operating on the granularity of the model. More importantly we offer a closed form conserv"},"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":"1604.08004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-04-27T10:08:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"55b52b7f505bd4073044ca8bdf09aa8792f5dbbb327210d389d5bfb3689485eb","abstract_canon_sha256":"0fccebe7126892fdc85f1383b372ceb6cffdf565b2640b00c8c43dc5198cef18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:08.424611Z","signature_b64":"kh8CuRTtLMkZQk+sq8lcnkj//D+822099dFfohU+olxcvL4xttKasC0C0kzmfgQzhqD7nh4GzAezU+2yT3GZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d693c643cd5f553e4d78a70b2fcc0dddefba10a1f7593dc95b09a29e2c9ab1a","last_reissued_at":"2026-05-18T01:16:08.423977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:08.423977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Analytical Solution for Probabilistic Guarantees of Reservation Based Soft Real-Time Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Bernardo Villalba Fr\\'ias, Daniele Fontanelli, Luca Abeni, Luigi Palopoli","submitted_at":"2016-04-27T10:08:53Z","abstract_excerpt":"We show a methodology for the computation of the probability of deadline miss for a periodic real-time task scheduled by a resource reservation algorithm. We propose a modelling technique for the system that reduces the computation of such a probability to that of the steady state probability of an infinite state Discrete Time Markov Chain with a periodic structure. This structure is exploited to develop an efficient numeric solution where different accuracy/computation time trade-offs can be obtained by operating on the granularity of the model. More importantly we offer a closed form conserv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08004","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":""},"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":"1604.08004","created_at":"2026-05-18T01:16:08.424057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08004v1","created_at":"2026-05-18T01:16:08.424057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08004","created_at":"2026-05-18T01:16:08.424057+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVUTYZB42X2V","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVUTYZB42X2VHZGX","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVUTYZB4","created_at":"2026-05-18T12:30:25.849896+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/JVUTYZB42X2VHZGXRJYLF7GA3X","json":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X.json","graph_json":"https://pith.science/api/pith-number/JVUTYZB42X2VHZGXRJYLF7GA3X/graph.json","events_json":"https://pith.science/api/pith-number/JVUTYZB42X2VHZGXRJYLF7GA3X/events.json","paper":"https://pith.science/paper/JVUTYZB4"},"agent_actions":{"view_html":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X","download_json":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X.json","view_paper":"https://pith.science/paper/JVUTYZB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08004&json=true","fetch_graph":"https://pith.science/api/pith-number/JVUTYZB42X2VHZGXRJYLF7GA3X/graph.json","fetch_events":"https://pith.science/api/pith-number/JVUTYZB42X2VHZGXRJYLF7GA3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/action/storage_attestation","attest_author":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/action/author_attestation","sign_citation":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/action/citation_signature","submit_replication":"https://pith.science/pith/JVUTYZB42X2VHZGXRJYLF7GA3X/action/replication_record"}},"created_at":"2026-05-18T01:16:08.424057+00:00","updated_at":"2026-05-18T01:16:08.424057+00:00"}