{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RYBJLHE7AXWBR2JB7SXJ4E3BA5","short_pith_number":"pith:RYBJLHE7","schema_version":"1.0","canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","source":{"kind":"arxiv","id":"1907.01240","version":2},"attestation_state":"computed","paper":{"title":"Timed Basic Parallel Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente, Patrick Totzke, Piotr Hofman","submitted_at":"2019-07-02T08:52:36Z","abstract_excerpt":"Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching rules, and as such may be used to model networks of independent timed automata with process creation.\n  We show that the coverability and reachability problems (with unary encoded target multiplicities) are PSPACE-complete and EXPTIME-complete, respectively. For the special case of 1-clock TBPP, both are NP-complete and hence not more complex than for untimed BPP"},"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":"1907.01240","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2019-07-02T08:52:36Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"46b17502c503444881f6f78d8bcf7b5da6832628bc3a6cb4bf37635b0aa0b335","abstract_canon_sha256":"ea791d83c406c7e0155217ce2430f4a0a15557f010a07ea5dcdb9553cba6c955"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:17.006973Z","signature_b64":"C602bMAM+m6tWwf4nGVhXxVuS/N1MTCV7cAegpBK9/KhoRGbaLxgL3K6u0KcPSI0gqUOMAiLiIqdX9GwKlRaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e02959c9f05ec18e921fcae9e1361074eb5576933b2e72f9945ec00cb2bf83d","last_reissued_at":"2026-05-17T23:41:17.006362Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:17.006362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Timed Basic Parallel Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Lorenzo Clemente, Patrick Totzke, Piotr Hofman","submitted_at":"2019-07-02T08:52:36Z","abstract_excerpt":"Timed basic parallel processes (TBPP) extend communication-free Petri nets (aka. BPP or commutative context-free grammars) by a global notion of time. TBPP can be seen as an extension of timed automata (TA) with context-free branching rules, and as such may be used to model networks of independent timed automata with process creation.\n  We show that the coverability and reachability problems (with unary encoded target multiplicities) are PSPACE-complete and EXPTIME-complete, respectively. For the special case of 1-clock TBPP, both are NP-complete and hence not more complex than for untimed BPP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01240","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":"1907.01240","created_at":"2026-05-17T23:41:17.006464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01240v2","created_at":"2026-05-17T23:41:17.006464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01240","created_at":"2026-05-17T23:41:17.006464+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYBJLHE7AXWB","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYBJLHE7AXWBR2JB","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYBJLHE7","created_at":"2026-05-18T12:33:27.125529+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/RYBJLHE7AXWBR2JB7SXJ4E3BA5","json":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5.json","graph_json":"https://pith.science/api/pith-number/RYBJLHE7AXWBR2JB7SXJ4E3BA5/graph.json","events_json":"https://pith.science/api/pith-number/RYBJLHE7AXWBR2JB7SXJ4E3BA5/events.json","paper":"https://pith.science/paper/RYBJLHE7"},"agent_actions":{"view_html":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5","download_json":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5.json","view_paper":"https://pith.science/paper/RYBJLHE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01240&json=true","fetch_graph":"https://pith.science/api/pith-number/RYBJLHE7AXWBR2JB7SXJ4E3BA5/graph.json","fetch_events":"https://pith.science/api/pith-number/RYBJLHE7AXWBR2JB7SXJ4E3BA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/action/storage_attestation","attest_author":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/action/author_attestation","sign_citation":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/action/citation_signature","submit_replication":"https://pith.science/pith/RYBJLHE7AXWBR2JB7SXJ4E3BA5/action/replication_record"}},"created_at":"2026-05-17T23:41:17.006464+00:00","updated_at":"2026-05-17T23:41:17.006464+00:00"}