skip to main content
10.1145/277044.277202acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free Access

Efficient state classification of finite state Markov chains

Authors Info & Claims
Published:01 May 1998Publication History

ABSTRACT

This paper presents an efficient method for state classification of finite state Markov chains using BDD-based symbolic techniques. The method exploits the fundamental properties of a Markov chain and classifies the state space by iteratively applying reachability analysis. We compare our method with the current state-of-the-art technique which requires the computation of the transitive closure of the transition relation of a Markov chain. Experiments in over a dozen synchronous and asynchronous systems demonstrate that our method dramatically reduces the CPU time needed, and solves much larger problems because of reduced memory requiremen ts.

References

  1. 1.M. Malhotra and K. S. Trivedi. Power-hierarchy of dependability-model types. IEEE Trans. on Reliability, 43(3), Sept. 1994.Google ScholarGoogle ScholarCross RefCross Ref
  2. 2.0. Daniel Z. Simeu-Abazi and B. Descotes-Genon. Analytical method to evaluate the dependability of manufacturing systems. Reliability Engineering ~ Systems Safety, 55(2), Feb. 1997.Google ScholarGoogle Scholar
  3. 3.A.M. Stankovic, G.C. Verghese, and D. J. Perreault. Randomized modulation of power converters via Markov chains, IEEE Trans. on Control Systems Technology, 5(1), Jan. 1997.Google ScholarGoogle ScholarCross RefCross Ref
  4. 4.R. Marculescu, D. Marculescu, and M. Pedram. Efficient power estimation for highly correlated input streams. In Proc. ACM/IEEE Design Automation Conf.,1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.P.A. Beerel and H. S. Wadekar. Energy estimation of speedindependent control circuits. IEEE Trans. on Computer- Aided Design, pp. 672-680, June 1996.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.M. Holiday and M. Vernon. A generalized timed Petri net model for performance analysis. IEEE Trans. on Software Engineering, 13:1297-1310, Dec. 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.P. Kudva, G. Gopalakrishnan, E. Brunvand, and V. Akella. Performance analysis and optimization of asynchronous circuits. In Proc. Int. Con}. Computer Design (ICCD), pp. 221-225, Oct. 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.A_ Xie and P.A_ Beerel. Symbolic techniques for performance analysis of asynchronous systems based on average time separationsof events. In Proc. Int. Syrup. on Adv. Res. in Asynchronous Circuits and Systems, pp. 64-75, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.R. M. Izquierdo and D. S. Reeves. MPEG VBR slice layer model using linear predictive coding and generalized periodic Markov chains. In IEEE Int. Performance, Computing and Communications Conf., 1997.Google ScholarGoogle Scholar
  10. 10.T. Takine, T. Suda, and T. Hasegawa. Cell-loss and output process analysis of a finite-buff discrete-time atm queueing system with correlated arrival. IEEE Trans. on Communications, 43(2-4), Feb.-March 1995.Google ScholarGoogle Scholar
  11. 11.G. D. Hachtel, E. Macii,/L Pardo, and F. Somenzi. Markovian analysis of large finite state machinesJEEE Trans. on Computer-Aided Design, pp. 1479-1493, Dec. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.R. E. Bryant. Graph-based algorithm for boolean function munipulation. IEEE Trans. on Computers, 35, Aug. 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Y. Matsunaga, P. C. McGeer, and R. IC Brayton. On computing the transitive closure of a state transition relation. In Proc. ACM/IEEE Design Automation Conf., 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer, 1976.Google ScholarGoogle Scholar
  15. 15.R. /L Howard. Dynamic Probabilistic Systems, Volume I: Markov Models. John Wiley & Sons, Inc, 1971.Google ScholarGoogle Scholar
  16. 16.G. D. Hachtel and F. Somenzi. A symbolic algorithm for maximum flow in 0-1 networks. In Proc. Int. Conf. Computer-Aided Design (ICCAD), 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMiUan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Trans. on Computer-Aided Design, 13(4), Apr. 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.0. Coudert, J. C. Madre, and C. Berthet. Verifying temporal properties of sequential machines without building their state diagrams. In E. M. Clarke and R. P. Kurshan, editors, Computer-Aided Verification'90. American Mathematical Society, June 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.R. I. Bahar, E./L Frohm, C. M. Gaona, and G. D. Hachtel. Algebraic decision diagrams and their applications. IProc. Int. Conj. Computer-Aided Design (ICCAD), 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.ICY. Yun and R. P. Donohue. Pausible clocking: A first step toward heterogeneous systems. In Proc. Int. Conj. Computer Design (ICCD), pp. 118-123. Oct. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.L. Kleinrock. Queueing Systems, Volume H: Application. Wiley, New York, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient state classification of finite state Markov chains

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in
                  • Published in

                    cover image ACM Conferences
                    DAC '98: Proceedings of the 35th annual Design Automation Conference
                    May 1998
                    820 pages
                    ISBN:0897919645
                    DOI:10.1145/277044

                    Copyright © 1998 ACM

                    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 May 1998

                    Permissions

                    Request permissions about this article.

                    Request Permissions

                    Check for updates

                    Qualifiers

                    • Article

                    Acceptance Rates

                    Overall Acceptance Rate1,770of5,499submissions,32%

                    Upcoming Conference

                    DAC '24
                    61st ACM/IEEE Design Automation Conference
                    June 23 - 27, 2024
                    San Francisco , CA , USA

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader