Abstract: A method for synchronizing common values in a distributed system, at least one node of which is a cyclic, rule-based, object-sensitive production system. Values altered in one part of the system are implicity rather than explicitly communicated and processed to and from the rule-based node. All communications to the rule-based node of common values changed by the nonrule-based nodes are by way of a list independent of and concurrently with any procedural request of the rule-based node, there being no necessary relation between the list contents and the procedural request.

Abstract: A method for coordinating recursive requests and responses in the peer-to-peer processing of a distributed application across a synchronous request/response interface. The method utilizes, on each side of the interface, a decision table and a local LIFO stack of generated and received requests, responses, and input from the application. The local stack is run in a push-pop manner and assists the local decision table in conducting the peer-to-peer processing until the LIFO stack becomes exhausted. A fault on either side of the interface results in undoing the processing by unwinding each stack back to a predetermined point. If one side operates as a persistent server, its application program environment is saved from one request to another by a dynamic save and simulated return to the application. Lastly, a request/demand is substituted for a demand/request by the server so as to change the server and requester roles of either side of the interface.