An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems

Determining the time separation of events is a fundamental problem in the analysis, synthesis, and optimization of concurrent systems. Applications range from logic optimization of asynchronous digital circuits to evaluation of execution times of programs for real-time systems. We present an efficient algorithm to find exact (tight) bounds on the separation time of events in an arbitrary process graph without conditional behavior. This result is more general than the methods presented in several previously published papers as it handles cyclic graphs and yields the tightest possible bounds on event separations. The algorithm is based on a functional decomposition technique that permits the implicit evaluation of an infinitely unfolded process graph. Examples are presented that demonstrate the utility and efficiency of the solution. The algorithm will form a basis for exploration of timing-constrained synthesis techniques. >

[1]  Alan A. Desrochers.  Performance analysis using Petri nets , 1992, J. Intell. Robotic Syst..

[2]  M. N. Shanmukha Swamy,et al.  Graphs: Theory and Algorithms , 1992 .

[3]  Joseph Sifakis,et al.  Compiling Real-Time Specifications into Extended Automata , 1992, IEEE Trans. Software Eng..

[4]  Steven M. Burns,et al.  Bounded delay timing analysis of a class of CSP programs with choice , 1994, Proceedings of 1994 IEEE Symposium on Advanced Research in Asynchronous Circuits and Systems.

[5]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[6]  Gaetano Borriello,et al.  Practical applications of an efficient time separation of events algorithm , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[7]  Ganesh Gopalakrishnan,et al.  Performance analysis and optimization of asynchronous circuits , 1994, Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[8]  R. Graham,et al.  On a linear diophantine problem of Frobenius , 1972 .

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[10]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[11]  Gaetano Borriello,et al.  An algorithm for exact bounds on the time separation of events in concurrent systems , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[12]  Farnam Jahanian,et al.  Verifying properties of systems with variable timing constraints , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[13]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[14]  Insup Lee,et al.  Proving a Network of Real-Time Processes Correct , 1985, RTSS.

[15]  R. K. Shyamasundar,et al.  Static Analysis of Real-Time Distributed Systems , 1988, IEEE Trans. Software Eng..

[16]  M. Gordon.  HOL: A Proof Generating System for Higher-Order Logic , 1988 .

[17]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[18]  Steven M. Burns,et al.  Timing analysis of timed event graphs with bounded delays using algebraic techniques , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[19]  Mark Russell Greenstreet,et al.  Stari: a technique for high-bandwidth communication , 1993 .

[20]  Gaetano Borriello,et al.  An approach to symbolic timing verification , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[21]  Rajeev Alur,et al.  The Theory of Timed Automata , 1991, REX Workshop.

[22]  Alain J. Martin.  Programming in VLSI: from communicating processes to delay-insensitive circuits , 1991 .

[23]  Jonathan S. Ostroff,et al.  Deciding Properties of Timed Transition Models , 1990, IEEE Trans. Parallel Distributed Syst..

[24]  E. Clarke,et al.  Real-time symbolic model checking for discrete time models , 1994 .

[25]  Teresa H. Y. Meng,et al.  Synthesis of Timed Asynchronous CircuitsChris , 1993 .

[26]  Jonathan S. Ostroff.  Verification of Safety Critical Systems Using TTM/RTTL , 1991, REX Workshop.

[27]  David L. Dill,et al.  Algorithms for interface timing verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[28]  M. Newman,et al.  Topics in Algebra , 1978 .

[29]  Steven M. Burns,et al.  The design of an asynchronous microprocessor , 1989, CARN.

[30]  Steven P. Levitan,et al.  Temporal Analysis of Time Bounded Digital Systems , 1993, CHARME.

[31]  Ronald L. Rivest,et al.  The Design and Analysis of Computer Algorithms , 1990 .

[32]  E. Clarke,et al.  Automatic Veriication of Nite-state Concurrent Systems Using Temporal-logic Speciications. Acm , 1993 .

[33]  G. Olsder,et al.  Discrete event systems with stochastic processing times , 1990 .

[34]  Dan Ionescu,et al.  Asymptotic behaviour of output feedback for a class of non-deterministic discrete event systems , 1991 .

[35]  Donald M. Chiarulli,et al.  Timing verification using HDTV , 1991, DAC '90.

[36]  Stéphane Gaubert,et al.  Rational computation in dioid algebra and its application to performance evaluation of Discrete Event Systems , 1991 .

[37]  Farnam Jahanian,et al.  A Method for Verifying Properties of Modechart Specifications , 1988, RTSS.

[38]  Aloysius K. Mok,et al.  A Graph-Theoretic Approach for Timing Analysis and its Implementation , 1987, IEEE Transactions on Computers.

[39]  Randy H. Katz,et al.  A new interface specification methodology and its application to transducer synthesis , 1988 .

[40]  Tomas Rokicki.  Representing and modeling digital circuits , 1994 .

[41]  G. Goossens,et al.  Specification and analysis of timing constraints in signal transition graphs , 1992, [1992] Proceedings The European Conference on Design Automation.

[42]  Geert Jan Olsder,et al.  Asymptotic behavior of random discrete event systems , 1990 .