{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4E7AYJ7K25OUN7MJPF765XGGXN","short_pith_number":"pith:4E7AYJ7K","schema_version":"1.0","canonical_sha256":"e13e0c27ead75d46fd89797feedcc6bb5e816b12acf2448a46963d5ecbadca10","source":{"kind":"arxiv","id":"1508.02326","version":2},"attestation_state":"computed","paper":{"title":"Model Checking Resource Bounded Systems with Shared Resources via Alternating B\\\"uchi Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hoang Nga Nguyen, Nils Bulling","submitted_at":"2015-08-10T17:10:13Z","abstract_excerpt":"It is well known that the verification of resource-constrained multiagent systems is undecidable in general. In many such settings, resources are private to agents. In this paper, we investigate the model checking problem for a resource logic based on Alternating-Time Temporal Logic (ATL) with shared resources. Resources can be consumed and produced up to any amount. We show that the model checking problem is undecidable if two or more of such unbounded resources are available. Our main technical result is that in the case of a single shared resource, the problem becomes decidable. Although in"},"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":"1508.02326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-10T17:10:13Z","cross_cats_sorted":[],"title_canon_sha256":"1d58d37783506ed1cde536e61a6389c4c2b739c2fd3df919ab3447d71a4e3096","abstract_canon_sha256":"9864414bba62853516e1b6fc73ccdd4d45529c59b2069bbdd9d449eb7aa8647f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:19.949533Z","signature_b64":"PvWPb6vdv3j2mrIgdAPkYeMLzpjMTYsNIFDejH4WfB97xuDEZjppl8CImJswHyL8YzF49qsY80Z4MOHusX+bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e13e0c27ead75d46fd89797feedcc6bb5e816b12acf2448a46963d5ecbadca10","last_reissued_at":"2026-05-18T01:35:19.948897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:19.948897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model Checking Resource Bounded Systems with Shared Resources via Alternating B\\\"uchi Pushdown Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hoang Nga Nguyen, Nils Bulling","submitted_at":"2015-08-10T17:10:13Z","abstract_excerpt":"It is well known that the verification of resource-constrained multiagent systems is undecidable in general. In many such settings, resources are private to agents. In this paper, we investigate the model checking problem for a resource logic based on Alternating-Time Temporal Logic (ATL) with shared resources. Resources can be consumed and produced up to any amount. We show that the model checking problem is undecidable if two or more of such unbounded resources are available. Our main technical result is that in the case of a single shared resource, the problem becomes decidable. Although in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02326","kind":"arxiv","version":2},"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":"1508.02326","created_at":"2026-05-18T01:35:19.949003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02326v2","created_at":"2026-05-18T01:35:19.949003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02326","created_at":"2026-05-18T01:35:19.949003+00:00"},{"alias_kind":"pith_short_12","alias_value":"4E7AYJ7K25OU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4E7AYJ7K25OUN7MJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4E7AYJ7K","created_at":"2026-05-18T12:29:05.191682+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/4E7AYJ7K25OUN7MJPF765XGGXN","json":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN.json","graph_json":"https://pith.science/api/pith-number/4E7AYJ7K25OUN7MJPF765XGGXN/graph.json","events_json":"https://pith.science/api/pith-number/4E7AYJ7K25OUN7MJPF765XGGXN/events.json","paper":"https://pith.science/paper/4E7AYJ7K"},"agent_actions":{"view_html":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN","download_json":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN.json","view_paper":"https://pith.science/paper/4E7AYJ7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02326&json=true","fetch_graph":"https://pith.science/api/pith-number/4E7AYJ7K25OUN7MJPF765XGGXN/graph.json","fetch_events":"https://pith.science/api/pith-number/4E7AYJ7K25OUN7MJPF765XGGXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN/action/storage_attestation","attest_author":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN/action/author_attestation","sign_citation":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN/action/citation_signature","submit_replication":"https://pith.science/pith/4E7AYJ7K25OUN7MJPF765XGGXN/action/replication_record"}},"created_at":"2026-05-18T01:35:19.949003+00:00","updated_at":"2026-05-18T01:35:19.949003+00:00"}