arXiv (All)
open access
Causal graph rewriting
We introduce causal graph rewriting, a model of computation in which local rules are applied on directed acyclic graphs in an asynchronous manner. The non-determinism arising from asynchrony is disciplined by the oriented edges, which must be understood as both computational dependencies and localit
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Zero Forcing Sets in Temporal Graphs#1076983
- Proof-of-Continuity: A Temporal Model for Authority Propagation in Distributed Systems and AI Agents#361419
- Causal Routing for Unlearning#1128744
- From Papers to Interpretive Knowledge Nodes: Proposing the Missing Object in Scholarly Knowledge Circulation#1034817
- DMG: A Scalable and Efficient Memory-Disaggregated Graph Processing System#394373
Record · ID 1051681
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive