Using logic to solve the submodule construction problem
نویسنده
چکیده
Submodule construction is the problem of finding a new submodule which, together with a given submodule, provides a behavior that conforms to a given desired global behavior. A new formulation of this problem and its solution in first-order logic is presented, and it is shown how the known solutions to this problem in the context of various communication paradigms and specification formalisms can be derived. Communication paradigms are: synchronous rendezvous at several interfaces; interleaved rendezvous; input/output automata with complete or partial behavior specifications and with synchronous or interleaved communication. A new algorithm for deriving a progressive solution is also presented.
منابع مشابه
Using First-Order Logic to Reason about Submodule Construction
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? This problem has been called "submodule construction" or "equation solving”. Solutions to this probl...
متن کاملUsing First-Order Logic to Reason about Submodule Construction1
We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? This problem has been called "submodule construction" or "equation solving"; and in the context of s...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملFuzzy logic controlled differential evolution to solve economic load dispatch problems
In recent years, soft computing methods have generated a large research interest. The synthesis of the fuzzy logic and the evolutionary algorithms is one of these methods. A particular evolutionary algorithm (EA) is differential evolution (DE). As for any EA, DE algorithm also requires parameters tuning to achieve desirable performance. In this paper tuning the perturbation factor vector of DE ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Event Dynamic Systems
دوره 23 شماره
صفحات -
تاریخ انتشار 2013