Accelerating Markovian analysis of asynchronous systems using state compression

This paper presents a methodology to speed up the stationary analysis of large Markov chains that model asynchronous systems. Instead of directly working on the original Markov chain, we propose to analyze a smaller Markov chain obtained via a novel technique called state compression. Once the smaller chain is solved, the solution to the original chain is obtained via a process called expansion. The method is especially powerful when the Markov chain has a small feedback vertex set, which happens often in asynchronous systems that contain mostly bounded-delay components. Our experimental results show that the method can yield reductions of more than an order of magnitude in CPU time and facilitate the analysis of larger systems than possible using traditional techniques.

[1]  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.

[2]  Chris J. Myers,et al.  Verification of Timed Systems Using POSETs , 1998, CAV.

[3]  Peter A. Beerel,et al.  A Low-Control-Overhead Asynchronous Differential Equation Solver , 1996, ESSCIRC '96: Proceedings of the 22nd European Solid-State Circuits Conference.

[4]  Stephen H. Unger,et al.  Asynchronous sequential switching circuits , 1969 .

[5]  Frederick W. Leysieffer,et al.  WEAK LUMPABILITY IN FINITE MARKOV CHAINS , 1982 .

[6]  Charles E. Molnar,et al.  Anomalous Behavior of Synchronizer and Arbiter Circuits , 1973, IEEE Transactions on Computers.

[7]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[8]  Xi-Ren Cao,et al.  Perturbation analysis of discrete event dynamic systems , 1991 .

[9]  Tam-Anh Chu,et al.  Synthesis of self-timed VLSI circuits from graph-theoretic specifications , 1987 .

[10]  David L. Dill,et al.  Synthesis of asynchronous state machines using a local clock , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[11]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[12]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[13]  A. L. Davis.  A Data-Drive Machine Architecture Suitable for VLSI Implementation , 1979 .

[14]  Enrico Macii,et al.  Markovian analysis of large finite state machines , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Peter A. Beerel,et al.  The design and verification of a high-performance low-control-overhead asynchronous differential equation solver , 1997, Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[16]  Alexandre Yakovlev,et al.  Signal Graphs: From Self-Timed to Timed Ones , 1985, PNPM.

[17]  Michael K. Molloy.  Discrete Time Stochastic Petri Nets , 1985, IEEE Transactions on Software Engineering.

[18]  Sungju Park,et al.  A Graph Theoretic Approach to Partial Scan Design by K-Cycle Elimination , 1992, Proceedings International Test Conference 1992.

[19]  Kenneth Steiglitz,et al.  Bubbles can make self-timed pipelines fast , 1990, J. VLSI Signal Process..

[20]  J. Ben Atkinson,et al.  Modeling and Analysis of Stochastic Systems , 1996 .

[21]  Mary K. Vernon,et al.  A Generalized Timed Petri Net Model for Performance Analysis , 1985, IEEE Transactions on Software Engineering.

[22]  Jeffrey S. Rosenthal,et al.  Convergence Rates for Markov Chains , 1995, SIAM Rev..

[23]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

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

[25]  Kenneth Y. Yun,et al.  Synthesis of 3D asynchronous state machines , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[26]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[27]  G. Stewart.  Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices , 1976 .

[28]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[29]  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.

[30]  R. GREENSTREET,et al.  Bubbles Can Make Self-Timed Pipelines Fastt , 1990 .

[31]  P. Beerel,et al.  Efficient state classification of finite state Markov chains , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[32]  Michael K. Molloy,et al.  On the integration of delay and throughput measures in distributed processing models , 1981 .

[33]  Jo C. Ebergen,et al.  Response time properties of some asynchronous circuits , 1997, Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[34]  Peter A. Beerel,et al.  Symbolic techniques for performance analysis of timed systems based on average time separation of events , 1997, Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[35]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[36]  Gaetano Borriello,et al.  An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems , 1995, IEEE Trans. Computers.

[37]  Ran Ginosar,et al.  Average-case optimized technology mapping of one-hot domino circuits , 1998, Proceedings Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[38]  Graeme Smith,et al.  The identification of a minimal feedback vertex set of a directed graph , 1975 .

[39]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[40]  Doron A. Peled,et al.  Static Partial Order Reduction , 1998, TACAS.

[41]  Kai Hwang,et al.  Performance Analysis of Four Memory Consistency Models for Multithreaded Multiprocessors , 1995, IEEE Trans. Parallel Distributed Syst..

[42]  Jürgen Teich,et al.  Performance analysis and optimization of mixed asynchronous synchronous systems , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[43]  Gerardo Rubino,et al.  ON WEAK LUMPABILITY IN MARKOV CHAINS , 1989 .

[44]  Harold J. Kushner,et al.  A Control Problem for a New Type of Public Transportation System, via Heavy Traffic Analysis , 1995 .

[45]  G. Rubino,et al.  Sojourn times in finite Markov processes , 1989, Journal of Applied Probability.

[46]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[47]  Peter A. Beerel,et al.  Estimation of energy consumption in speed-independent control circuits , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[48]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[49]  N. S. Barnett,et al.  Private communication , 1969 .

[50]  Kenneth Y. Yun,et al.  Pausible clocking: a first step toward heterogeneous systems , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

[51]  Tak Kwan Lee,et al.  A General Approach to Performance Analysis and Optimization of Asynchronous Circuits , 1995 .

[52]  K.-T. Cheng,et al.  A Partial Scan Method for Sequential Circuits with Feedback , 1990, IEEE Trans. Computers.