Andere Kunden interessierten sich auch für
![Concurrent Engineering and Design for Manufacture of Electronics Products]( "Concurrent Engineering and Design for Manufacture of Electronics Products")
Concurrent Engineering and Design for Manufacture of Electronics Products83,99 €![Distributed, Concurrent and Independent Access to Cloud Database]( "Distributed, Concurrent and Independent Access to Cloud Database")
Distributed, Concurrent and Independent Access to Cloud Database23,99 €![Cost-Effective Verification of Concurrent Safety-Critical Systems]( "Cost-Effective Verification of Concurrent Safety-Critical Systems")
Cost-Effective Verification of Concurrent Safety-Critical Systems51,99 €![Logical Analysis of Complex Concurrent Systems]( "Logical Analysis of Complex Concurrent Systems")
Logical Analysis of Complex Concurrent Systems51,99 €![Low Power Hardware Synthesis from Concurrent Action-Oriented Specifications]( "Low Power Hardware Synthesis from Concurrent Action-Oriented Specifications")
Low Power Hardware Synthesis from Concurrent Action-Oriented Specifications74,99 €![Concurrent Objects and Beyond]( "Concurrent Objects and Beyond")
Concurrent Objects and Beyond37,99 €![Concurrent Programming: Algorithms, Principles, and Foundations]( "Concurrent Programming: Algorithms, Principles, and Foundations")
Concurrent Programming: Algorithms, Principles, and Foundations48,99 €
High Quality Content by WIKIPEDIA articles! Concurrent MetateM is a multi-agent language in which each agent is programmed using a set of (augmented) temporal logic 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 Gabbay's separation theorem; any arbitrary temporal logic formula can be rewritten in a logically equivalent past = future form. Execution proceeds by a process of continually matching rules against a history, and firing those rules when antecedents 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.