Scheduling of signal transition graphs under timing constraints

In this paper the introduction of interval based timing constraints in Signal Transition Graphs (STGs) is discussed. As a novel contribution we propose a general method to analyse these timing constraints according to different firing rules in cyclic STG. This method is based on the formulation and solution of an optimization problem. Results are presented for establishing the precedence relation of transitions, which is important in consideration of the synthesis process of asynchronous communication protocols