language: en

Timing Analysis of Concurrent Systems An Algorithm for Determining Time Separation of Events

Tod Amon, Henrik Hulgaard, Gaetano Borriello, Steve Burns
Department of Computer Science and Engineering, FR-35 University of Washington
Seattle, WA 98195 USA

Abstract A fundamental problem in the synthesis and optimization of concurrent systems is the determination of the separation time between system events. We present a theoretical framework for solving this problem for arbitrary process graphs without conditional behavior and develop an efficient and exact algorithm based on this theoretical foundation. Examples are used to demonstrate the operation and generality of the algorithm.

1 Introduction