Asynchronous Graph Rewriting with Consistent Space-Time Dynamics

Asynchronous applications of local graph rewriting rules can produce well-determined space-time dynamics, provided the rules satisfy certain conditions such as commutativity, monotonicity, and port-decreasingness.