{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DONYPSAUMPQFOVBKQXU4VUL62M","short_pith_number":"pith:DONYPSAU","schema_version":"1.0","canonical_sha256":"1b9b87c81463e057542a85e9cad17ed31131b9b921ecf23b2e943b74409d1da3","source":{"kind":"arxiv","id":"1709.00826","version":1},"attestation_state":"computed","paper":{"title":"Analysing Mutual Exclusion using Process Algebra with Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Australia), CSIRO, France), Paris, Peter H\\\"ofner (Data61, Rob van Glabbeek (Data61, Sydney, Victor Dyseryn (Ecole Polytechnique","submitted_at":"2017-09-04T06:27:52Z","abstract_excerpt":"In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions. Adding a fairness assumption to implement a mutual exclusion protocol seems counter-intuitive.  We employ a signalling operator, which can be combined with CCS, or other process calculi, and show that this minimal extension is expressive enough to model mutual exclusion: we confirm the correctness of Peterson's mutual exclusion algorithm for two processes, as we"},"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":"1709.00826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-04T06:27:52Z","cross_cats_sorted":[],"title_canon_sha256":"79d8844f2e3ddd11f26384d971170fee1a0a809cf764c1fefe5f795321924dfe","abstract_canon_sha256":"c9ad09d88ef17a2d3b6f7fe8f7fa082fd55c8db431aefc6e9ff88ece9ec5ac91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:05.011390Z","signature_b64":"Q8tCY4RIhQjLN0dCH3kN+ftYEYgmEmnxUlqaFDXwSjSp4u22hxpLV2RUdn+wwQuTUo5M5sWoe+kyS3gs6H8kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b9b87c81463e057542a85e9cad17ed31131b9b921ecf23b2e943b74409d1da3","last_reissued_at":"2026-05-18T00:36:05.010750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:05.010750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysing Mutual Exclusion using Process Algebra with Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Australia), CSIRO, France), Paris, Peter H\\\"ofner (Data61, Rob van Glabbeek (Data61, Sydney, Victor Dyseryn (Ecole Polytechnique","submitted_at":"2017-09-04T06:27:52Z","abstract_excerpt":"In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions. Adding a fairness assumption to implement a mutual exclusion protocol seems counter-intuitive.  We employ a signalling operator, which can be combined with CCS, or other process calculi, and show that this minimal extension is expressive enough to model mutual exclusion: we confirm the correctness of Peterson's mutual exclusion algorithm for two processes, as we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00826","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":"1709.00826","created_at":"2026-05-18T00:36:05.010852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00826v1","created_at":"2026-05-18T00:36:05.010852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00826","created_at":"2026-05-18T00:36:05.010852+00:00"},{"alias_kind":"pith_short_12","alias_value":"DONYPSAUMPQF","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DONYPSAUMPQFOVBK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DONYPSAU","created_at":"2026-05-18T12:31:12.930513+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/DONYPSAUMPQFOVBKQXU4VUL62M","json":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M.json","graph_json":"https://pith.science/api/pith-number/DONYPSAUMPQFOVBKQXU4VUL62M/graph.json","events_json":"https://pith.science/api/pith-number/DONYPSAUMPQFOVBKQXU4VUL62M/events.json","paper":"https://pith.science/paper/DONYPSAU"},"agent_actions":{"view_html":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M","download_json":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M.json","view_paper":"https://pith.science/paper/DONYPSAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00826&json=true","fetch_graph":"https://pith.science/api/pith-number/DONYPSAUMPQFOVBKQXU4VUL62M/graph.json","fetch_events":"https://pith.science/api/pith-number/DONYPSAUMPQFOVBKQXU4VUL62M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M/action/storage_attestation","attest_author":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M/action/author_attestation","sign_citation":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M/action/citation_signature","submit_replication":"https://pith.science/pith/DONYPSAUMPQFOVBKQXU4VUL62M/action/replication_record"}},"created_at":"2026-05-18T00:36:05.010852+00:00","updated_at":"2026-05-18T00:36:05.010852+00:00"}