Design of repetitive systems with concurrently executed cyclic processes requires solving a problem of resources conflict resolution. A solution to the problem is a best schedule, which takes into account mutual execution of the processes sharing common resources and certain performance evaluation criterion. The considered problem resolution consists in finding a schedule with no process waiting for access to the shared resources and wherefore leading to controls not requiring resource conflict resolution. The problem is formulated as a task of prototyping of conditions sufficient for existence of a waiting-free n-process execution. The conditions prototyping is then examined within the framework of logic-algebraic method. The illustrative example of the approach proposed is provided.
Read full abstract