Referenced Items are not available for this document.
Symbolic techniques using BDDs and ADDs are applied to the performance analysis of (asynchronous) timed systems. We model the system as a set of probabilistic finite state machines which is analyzed as a discrete time Markov chain. The stationary probability of all reachable states is obtained iteratively using ADDs. Average time separation of events is symbolically calculated to determine various performance metrics. Application to a FIFO and a differential equation solver chip demonstrates the feasibility of the technique
Published in:
Advanced Research in Asynchronous Circuits and Systems, 1997. Proceedings., Third International Symposium on
Date of Conference: 7-10 Apr 1997
- Page(s):
- 64 - 75
- Meeting Date :
- 07 Apr 1997-10 Apr 1997
- Print ISBN:
- 0-8186-7922-0
- INSPEC Accession Number:
- 5572981
- Conference Location :
- Eindhoven
- Digital Object Identifier :
- 10.1109/ASYNC.1997.587164
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
