{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:ZHHXNAXBRG27NBNCVDRMXTMCYW","short_pith_number":"pith:ZHHXNAXB","schema_version":"1.0","canonical_sha256":"c9cf7682e189b5f685a2a8e2cbcd82c587ef4d01d1958eb1c2b0f0c4a4c4025f","source":{"kind":"arxiv","id":"cs/0312019","version":1},"attestation_state":"computed","paper":{"title":"Verification of recursive parallel systems","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Adriano Peron, Laura Bozzelli, Massimo Benerecetti","submitted_at":"2003-12-11T14:54:06Z","abstract_excerpt":"In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a class of properties about infinite derivations (infinite term rewritings). The given results can be exploited for the automatic verification of some classes of linear time properties of infinite state system"},"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":"cs/0312019","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2003-12-11T14:54:06Z","cross_cats_sorted":[],"title_canon_sha256":"d7253d10d5fcdc7ed72f0520d6a9f4fa14a5364c2de125e63cff2d031802f3b7","abstract_canon_sha256":"fa71e3fc7f7fac913c4ef3396433838cc05b52706060d156991c3a8bfd95cbe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:54.257509Z","signature_b64":"Kv4r1PgE39ZLXWOSeeREjBTYBln11FmlZjP5k4Hj9kAu/XSasg990ecSahIqIon3UqvTeqzs3hPNc1YwQZSdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9cf7682e189b5f685a2a8e2cbcd82c587ef4d01d1958eb1c2b0f0c4a4c4025f","last_reissued_at":"2026-05-18T04:08:54.256916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:54.256916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of recursive parallel systems","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Adriano Peron, Laura Bozzelli, Massimo Benerecetti","submitted_at":"2003-12-11T14:54:06Z","abstract_excerpt":"In this paper we consider the problem of proving properties of infinite behaviour of formalisms suitable to describe (infinite state) systems with recursion and parallelism. As a formal setting, we consider the framework of Process Rewriting Systems (PRSs). For a meaningfull fragment of PRSs, allowing to accommodate both Pushdown Automata and Petri Nets, we state decidability results for a class of properties about infinite derivations (infinite term rewritings). The given results can be exploited for the automatic verification of some classes of linear time properties of infinite state system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0312019","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":"cs/0312019","created_at":"2026-05-18T04:08:54.257007+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0312019v1","created_at":"2026-05-18T04:08:54.257007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0312019","created_at":"2026-05-18T04:08:54.257007+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHHXNAXBRG27","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHHXNAXBRG27NBNC","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHHXNAXB","created_at":"2026-05-18T12:25:52.051335+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/ZHHXNAXBRG27NBNCVDRMXTMCYW","json":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW.json","graph_json":"https://pith.science/api/pith-number/ZHHXNAXBRG27NBNCVDRMXTMCYW/graph.json","events_json":"https://pith.science/api/pith-number/ZHHXNAXBRG27NBNCVDRMXTMCYW/events.json","paper":"https://pith.science/paper/ZHHXNAXB"},"agent_actions":{"view_html":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW","download_json":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW.json","view_paper":"https://pith.science/paper/ZHHXNAXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0312019&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHHXNAXBRG27NBNCVDRMXTMCYW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHHXNAXBRG27NBNCVDRMXTMCYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW/action/storage_attestation","attest_author":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW/action/author_attestation","sign_citation":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW/action/citation_signature","submit_replication":"https://pith.science/pith/ZHHXNAXBRG27NBNCVDRMXTMCYW/action/replication_record"}},"created_at":"2026-05-18T04:08:54.257007+00:00","updated_at":"2026-05-18T04:08:54.257007+00:00"}