{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MHZ7XLCTHGFNTIGY4TH4CT67LW","short_pith_number":"pith:MHZ7XLCT","schema_version":"1.0","canonical_sha256":"61f3fbac53398ad9a0d8e4cfc14fdf5d8ad2b4ed74b59e0a6c7a1bc9bedae6af","source":{"kind":"arxiv","id":"1402.7150","version":1},"attestation_state":"computed","paper":{"title":"Synthesizing Finite-state Protocols from Scenarios and Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Abhishek Udupa, Christos Stergiou, Milo Martin, Mukund Raghothaman, Rajeev Alur, Stavros Tripakis","submitted_at":"2014-02-28T07:15:00Z","abstract_excerpt":"Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite-state protocols using scenarios: we show that it is possible to automatically derive a distributed implementation from a set of scenarios augmented with a set of safety and liveness requirements, provided the given scenarios adequately \\emph{cover} all the states of the desired implementation. We first derive incomplete state machines from the given scenarios, and then synthesis corresponds to completing the transit"},"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":"1402.7150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-02-28T07:15:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9c3e29a4ae0f8e1e1f5f5a4d795f093c273f6d7e98a1b307b672c9d050ef739c","abstract_canon_sha256":"284507bff43c1ac9d769bc08d0580ed496f959f167575273a9a452a42080a1e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.862453Z","signature_b64":"+TYDnySPzl+24Tr2L3RrocviMynnlb3nuT3e+LYsU1MbjgOJe3zZ5ITjacwxPYBwS7FnRBiixXyH+VQFV9iyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f3fbac53398ad9a0d8e4cfc14fdf5d8ad2b4ed74b59e0a6c7a1bc9bedae6af","last_reissued_at":"2026-05-18T02:57:34.861972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.861972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesizing Finite-state Protocols from Scenarios and Requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Abhishek Udupa, Christos Stergiou, Milo Martin, Mukund Raghothaman, Rajeev Alur, Stavros Tripakis","submitted_at":"2014-02-28T07:15:00Z","abstract_excerpt":"Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite-state protocols using scenarios: we show that it is possible to automatically derive a distributed implementation from a set of scenarios augmented with a set of safety and liveness requirements, provided the given scenarios adequately \\emph{cover} all the states of the desired implementation. We first derive incomplete state machines from the given scenarios, and then synthesis corresponds to completing the transit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7150","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":"1402.7150","created_at":"2026-05-18T02:57:34.862041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7150v1","created_at":"2026-05-18T02:57:34.862041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7150","created_at":"2026-05-18T02:57:34.862041+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHZ7XLCTHGFN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHZ7XLCTHGFNTIGY","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHZ7XLCT","created_at":"2026-05-18T12:28:38.356838+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/MHZ7XLCTHGFNTIGY4TH4CT67LW","json":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW.json","graph_json":"https://pith.science/api/pith-number/MHZ7XLCTHGFNTIGY4TH4CT67LW/graph.json","events_json":"https://pith.science/api/pith-number/MHZ7XLCTHGFNTIGY4TH4CT67LW/events.json","paper":"https://pith.science/paper/MHZ7XLCT"},"agent_actions":{"view_html":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW","download_json":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW.json","view_paper":"https://pith.science/paper/MHZ7XLCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7150&json=true","fetch_graph":"https://pith.science/api/pith-number/MHZ7XLCTHGFNTIGY4TH4CT67LW/graph.json","fetch_events":"https://pith.science/api/pith-number/MHZ7XLCTHGFNTIGY4TH4CT67LW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW/action/storage_attestation","attest_author":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW/action/author_attestation","sign_citation":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW/action/citation_signature","submit_replication":"https://pith.science/pith/MHZ7XLCTHGFNTIGY4TH4CT67LW/action/replication_record"}},"created_at":"2026-05-18T02:57:34.862041+00:00","updated_at":"2026-05-18T02:57:34.862041+00:00"}