document: Towards strong stability of concurrent repetitive processes sharing resources The paper presents a method for design of stability conditions of concurrent , repetitive processes sharing common resources . Steady-state behaviour of the system with m cyclic processes utilising a resource with the mutual exclusion is considered . Based on a recurrent equations framework necessary and sufficient conditions for the existence of maximal performance steady-state are presented . It was shown that if the conditions hold then the m-process system is marginally stable , i.e. , a steady-state of the system depends on the perturbations . The problem of finding the relative positions of the processes leading to waiting-free -LRB- maximal efficiency -RRB- steady-states of the system is formulated as a constraint logic programming problem . An example illustrating the solving of the problem for a 3-process system using object-oriented , constraint logic programming language Oz is presented . A condition sufficient for strong stability of the m-process system is given . When the condition holds then for any initial phases of the processes a waiting-free steady-state will be reached
doc_bio_tags: O B I O B I I O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O B I O O O O O O B I I B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O
extractive_keyphrases: strong stability concurrent repetitive processes common resources cyclic processes mutual exclusion recurrent equations framework necessary and sufficient conditions constraint logic programming
abstractive_keyphrases: steady-state behaviour maximal performance steady-state waiting-free steady-states 3-process system oz language