Concurrent MetateM

Concurrent MetateM is a <a href="/facts/Multi-agent_system/A85vt3UA">multi-agent</a> language in which each agent is programmed using a set of (augmented) <a href="/facts/Temporal_logic/vANP39lc">temporal logic</a> specifications of the behaviour it should exhibit. These specifications are executed directly to generate the behaviour of the agent. As a result, there is no risk of invalidating the logic as with systems where logical specification must first be translated to a lower-level implementation.
The root of the MetateM concept is <a href="/facts/Gabbay%2527s_separation_theorem/Do5XG8oL">Gabbay's separation theorem</a>; any arbitrary temporal logic formula can be rewritten in a <a href="/facts/Logical_equivalence/ysCWmsxA">logically equivalent</a> past → future form. Execution proceeds by a process of continually matching rules against a history, and firing those rules when <a href="/facts/Antecedent_(logic)/8VVVqa06">antecedents</a> are satisfied. Any instantiated future-time consequents become commitments which must subsequently be satisfied, iteratively generating a model for the formula made up of the program rules.

Concurrent MetateM open-in-new

Concurrent MetateM