A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
This paper describes a pseudo-polynomial time algorithm for timing analysis of a class of choice-free asynchronous systems, called tightly-coupled systems, with both min and max type timing constraints and bounded component delays. The algorithm consists of two phases: (i) longterm behavior analysis, that computes bounds on the time separation of events after the system has run for a sufficiently long period of time, and (ii) startup behavior analysis, that computes time separations betweendoi:10.1109/43.775628 fatcat:jtkb7ukomfd4jfkwbt2cp4hdwi