Timing analysis of timed event graphs with bounded delays using algebraic techniques
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 959-960
- https://doi.org/10.1109/cdc.1994.410932
Abstract
Timed event graphs constitute an important class of discrete event systems that have a wide domain of applicability. Analysing the temporal behavior of these systems has proven to be efficient, primarily through the use of algebraic techniques. In this paper, we present a major extension to this work, in that systems with timing properties that are specified using delay ranges, instead of fixed delays, are considered. We analyse the nonstochastic behavior of timed event graphs, and present an efficient algorithm to find exact (tight) upper and lower bounds on the separation in time of an arbitrary pair of system events. Stochastic analysis may be more suitable for studying efficiency and utilization, but non-stochastic techniques and tight upper and lower bounds on separation times, are useful for verifying correct operation.Keywords
This publication has 6 references indexed in Scilit:
- Algorithms for interface timing verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An algorithm for exact bounds on the time separation of events in concurrent systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Asymptotic behaviour of output feedback for a class of non-deterministic discrete event systemsInternational Journal of Control, 1991
- Discrete event systems with stochastic processing timesIEEE Transactions on Automatic Control, 1990
- Algebraic tools for the performance evaluation of discrete event systemsProceedings of the IEEE, 1989
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturingIEEE Transactions on Automatic Control, 1985