{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TTVGD4TW4ZTJZ4EZXLOUXTZVLE","short_pith_number":"pith:TTVGD4TW","schema_version":"1.0","canonical_sha256":"9cea61f276e6669cf099badd4bcf355930bd8c46ce802daf0bc7dbf141259cda","source":{"kind":"arxiv","id":"1209.0571","version":2},"attestation_state":"computed","paper":{"title":"Reachability of Communicating Timed Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Am\\'elie Stainer, Fr\\'ed\\'eric Herbreteau, Gr\\'egoire Sutre, Lorenzo Clemente","submitted_at":"2012-09-04T09:08:52Z","abstract_excerpt":"We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalen"},"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":"1209.0571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-09-04T09:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"113a4e42427a7d1b61cd39ddc3be58c694e7dec535aed20b0dec49ae5d576546","abstract_canon_sha256":"774f6cabd7811c87fb9455f10c9881d328cb190e36e1315017d444612cfa820d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:50.606358Z","signature_b64":"LqIe2f9Ftco3DfRNrAxWuwEE5KYuEhIEw+IdVXzwvjYXGqfp6PesqJU7qTGIrCVVKP8GkBMkFzKCFp0ayrqzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cea61f276e6669cf099badd4bcf355930bd8c46ce802daf0bc7dbf141259cda","last_reissued_at":"2026-05-18T02:20:50.605614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:50.605614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability of Communicating Timed Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Am\\'elie Stainer, Fr\\'ed\\'eric Herbreteau, Gr\\'egoire Sutre, Lorenzo Clemente","submitted_at":"2012-09-04T09:08:52Z","abstract_excerpt":"We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0571","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":"1209.0571","created_at":"2026-05-18T02:20:50.605753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0571v2","created_at":"2026-05-18T02:20:50.605753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0571","created_at":"2026-05-18T02:20:50.605753+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTVGD4TW4ZTJ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTVGD4TW4ZTJZ4EZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTVGD4TW","created_at":"2026-05-18T12:27:23.164592+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/TTVGD4TW4ZTJZ4EZXLOUXTZVLE","json":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE.json","graph_json":"https://pith.science/api/pith-number/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/graph.json","events_json":"https://pith.science/api/pith-number/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/events.json","paper":"https://pith.science/paper/TTVGD4TW"},"agent_actions":{"view_html":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE","download_json":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE.json","view_paper":"https://pith.science/paper/TTVGD4TW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0571&json=true","fetch_graph":"https://pith.science/api/pith-number/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/graph.json","fetch_events":"https://pith.science/api/pith-number/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/action/storage_attestation","attest_author":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/action/author_attestation","sign_citation":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/action/citation_signature","submit_replication":"https://pith.science/pith/TTVGD4TW4ZTJZ4EZXLOUXTZVLE/action/replication_record"}},"created_at":"2026-05-18T02:20:50.605753+00:00","updated_at":"2026-05-18T02:20:50.605753+00:00"}