{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LJY6AQBVXEUGV4D2JZKWA6B64R","short_pith_number":"pith:LJY6AQBV","schema_version":"1.0","canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","source":{"kind":"arxiv","id":"1402.2698","version":1},"attestation_state":"computed","paper":{"title":"Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.LO","authors_text":"Mateus de Oliveira Oliveira","submitted_at":"2014-02-11T23:50:39Z","abstract_excerpt":"In this work we provide algorithmic solutions to five fundamental problems concerning the verification, synthesis and correction of concurrent systems that can be modeled by bounded p/t-nets. We express concurrency via partial orders and assume that behavioral specifications are given via monadic second order logic. A c-partial-order is a partial order whose Hasse diagram can be covered by c paths. For a finite set T of transitions, we let P(c,T,\\phi) denote the set of all T-labelled c-partial-orders satisfying \\phi. If N=(P,T) is a p/t-net we let P(N,c) denote the set of all c-partially-order"},"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.2698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-11T23:50:39Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"06b814aaf861ba0ec3c71730017bab7dd701ec75241872fda3b4b3520b8ed84f","abstract_canon_sha256":"46fb854977accb5396715bf1fbffe5650368f92350146d1116fa54b747ea51f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:08.195218Z","signature_b64":"uVlGdIkbAHg+zP2pNyhTvWZx4MZkP7jejRBLs4eCQRGZJEF5d52EaBmhbBi7FFPXs+lSFjjlGJC4x039HZm2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","last_reissued_at":"2026-05-18T02:59:08.194505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:08.194505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.LO","authors_text":"Mateus de Oliveira Oliveira","submitted_at":"2014-02-11T23:50:39Z","abstract_excerpt":"In this work we provide algorithmic solutions to five fundamental problems concerning the verification, synthesis and correction of concurrent systems that can be modeled by bounded p/t-nets. We express concurrency via partial orders and assume that behavioral specifications are given via monadic second order logic. A c-partial-order is a partial order whose Hasse diagram can be covered by c paths. For a finite set T of transitions, we let P(c,T,\\phi) denote the set of all T-labelled c-partial-orders satisfying \\phi. If N=(P,T) is a p/t-net we let P(N,c) denote the set of all c-partially-order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2698","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.2698","created_at":"2026-05-18T02:59:08.194644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2698v1","created_at":"2026-05-18T02:59:08.194644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2698","created_at":"2026-05-18T02:59:08.194644+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJY6AQBVXEUG","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJY6AQBVXEUGV4D2","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJY6AQBV","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/LJY6AQBVXEUGV4D2JZKWA6B64R","json":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R.json","graph_json":"https://pith.science/api/pith-number/LJY6AQBVXEUGV4D2JZKWA6B64R/graph.json","events_json":"https://pith.science/api/pith-number/LJY6AQBVXEUGV4D2JZKWA6B64R/events.json","paper":"https://pith.science/paper/LJY6AQBV"},"agent_actions":{"view_html":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R","download_json":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R.json","view_paper":"https://pith.science/paper/LJY6AQBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2698&json=true","fetch_graph":"https://pith.science/api/pith-number/LJY6AQBVXEUGV4D2JZKWA6B64R/graph.json","fetch_events":"https://pith.science/api/pith-number/LJY6AQBVXEUGV4D2JZKWA6B64R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/action/storage_attestation","attest_author":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/action/author_attestation","sign_citation":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/action/citation_signature","submit_replication":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/action/replication_record"}},"created_at":"2026-05-18T02:59:08.194644+00:00","updated_at":"2026-05-18T02:59:08.194644+00:00"}