Stochastic timed marked graphs are graphical models of concurrent systems such as asynchronous circuits, embedded systems, queuing networks, manufacturing systems, and many automatic control systems. Unlike earlier works in which delays must be fixed or exponential, we allow the models to include arbitrary delay distributions as long as they have finite means. For such models, one important problem is to determine the average Time Separations of Events (TSE's). For example, an efficient means of finding TSE's in such models of asynchronous circuits facilitates both performance analysis as well as performance-driven synthesis. Towards this end, we present a novel technique to obtain upper and lower bounds on the average TSE for arbitrary pairs of system events. The bounds are formulated using a finite segment of the infinite unfolding of the marked graph and can be efficiently evaluated either using statistical sampling or, in some special cases, analytical methods. The resulting bounds are typically much sharper than using any other known method. The efficiency of technique and the quality of the bounds are demonstrated on several asynchronous pipelines. 1
|
1451
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
1023
|
Petri nets: Properties, analysis and applications
– Murata
- 1989
|
|
204
|
Statistical Inference
– Casella, Berger
- 1990
|
|
124
|
Synchronization and Linearity: An Algebra for Discrete Event Systems
– Baccelli, Cohen, et al.
- 1992
|
|
122
|
Performance analysis and optimization of asynchronous circuits
– Burns
- 1991
|
|
97
|
Marked directed graphs
– Commoner, Holt, et al.
- 1971
|
|
86
|
A Monte Carlo approach for power estimation
– Burch, Najm, et al.
- 1993
|
|
85
|
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
– Cohen, Dubois, et al.
- 1985
|
|
84
|
Performance evaluation of asynchronous concurrent systems using Petri nets
– Ramamoorthy, Ho
- 1980
|
|
81
|
Synthesis of timed asynchronous circuits
– Myers, Meng
- 1993
|
|
76
|
Basic notions of trace theory
– Mazurkiewicz
- 1988
|
|
67
|
Markovian Analysis of Large Finite State Machines
– Hachtel, Macii, et al.
- 1996
|
|
62
|
Algorithms for interface timing verification
– McMillan, Dill
- 1992
|
|
52
|
Self-timed rings and their application to division
– Williams
- 1991
|
|
52
|
A generalized timed Petri net model for performance analysis
– Holliday, Vernon
- 1987
|
|
52
|
RAPPID: An asynchronous instruction length decoder
– Rotem, Stevens, et al.
- 1999
|
|
46
|
Exact and ordinary lumpability in finite Markov chains
– Buchholz
- 1994
|
|
46
|
A Technique of State Space Search Based on Unfolding
– McMillan
- 1995
|
|
43
|
Subadditive ergodic theory
– Kingman
- 1973
|
|
43
|
Simulation output analysis using standardized time series
– Glynn, Iglehart
- 1990
|
|
41
|
Bounded delay timing analysis of a class of CSP programs with choice
– Hulgaard, Burns
- 1994
|
|
38
|
An algorithm for exact bounds on the time separation of events in concurrent systems
– Hulgaard, Burns, et al.
- 1995
|
|
37
|
Structure Theory of Petri Nets: the Free Choice Hiatus
– Best
- 1987
|
|
34
|
Verification of timed systems using POSETS
– Belluomini, Myers
- 1998
|
|
29
|
Properties and performance bounds for closed free choice synchronized monoclass queueing networks
– Campos, Chiola, et al.
- 1991
|
|
28
|
Faster Maximum and Minimum Mean Cycle Algorithms for System-Performance Analysis
– Dasdan, Gupta
- 1998
|
|
26
|
A course in Simulation
– Ross
- 1990
|
|
24
|
Probability and Statistics for Engineers
– Miller, Freund, et al.
- 1990
|
|
19
|
Accurate power estimation of CMOS sequential circuits
– Chou, Roy
- 1996
|
|
18
|
Accurate Power Estimation for Large Sequential Circuits
– Kozhaya, Najm
- 1997
|
|
16
|
Approximate algorithms for time separation of events
– Chakraborty, Dill
- 1997
|
|
14
|
A Generalized Timed Petri Net Model for Performance Analysis
– Holiday, Vernon
- 1987
|
|
14
|
Verification of asynchronous circuits using time Petri-net unfolding
– Semenov, Yakovlev
- 1996
|
|
12
|
Performance analysis and optimization of asynchronous circuits
– Kudva, Gopalakrishnan, et al.
- 1994
|
|
12
|
Properties and Performance Bounds for Timed Marked Graphs
– Campos, Chiola, et al.
- 1992
|
|
11
|
Efficient Timing Analysis of a Class of Petri Nets
– Hulgaard, Burns
- 1995
|
|
11
|
Ergodic theorems for stochastic operators and discrete event networks
– Baccelli, Mairesse
- 1995
|
|
11
|
Average-case optimized technology mapping of one-hot domino circuits
– Chou, Beerel, et al.
- 1998
|
|
10
|
Free choice systems have home states
– Best, Voss
- 1984
|
|
9
|
Efficient state classification of finite state Markov chains
– Xie, Beerel
- 1998
|
|
7
|
Response time properties of some asynchronous circuits
– Ebergen, Berks
- 1997
|
|
7
|
Partial order behavior and structure of Petri nets
– Best
- 1990
|
|
6
|
Accelerating Markovian analysis of asynchronous systems using state compression
– Xie, Beerel
- 1998
|
|
5
|
Symbolic techniques for performance analysis of asynchronous systems based on average time separation of events
– Xie, Beerel
- 1997
|
|
4
|
A characterization of the minimum cycle mean in a diagraph. Discrete mathematics
– Karp
- 1978
|
|
4
|
Some classes of live and safe Petri nets
– Best
- 1987
|
|
4
|
Estimation methods for stochastic Petri nets based on standardized time series
– Haas
- 1997
|
|
2
|
Structural performance analysis of stochastic Petri nets
– Silva, Campos
- 1995
|
|
1
|
Petri Nets Thoery and the Modeling of Systems
– Peterson
- 1981
|
|
1
|
Timed event-graphs and performance evaluation of systems
– Hillion, Levis
- 1987
|
|
