Muhammad A. Qureshi
Former group member (MS, 1992; Ph.D., 1996). Now at the Boeing Company.
Publications with the Performability Engineering Research Group
Performability Modeling with UltraSAN.
J. Couvillion, R. Freire, R. Johnson, W. D. Obal II, M. A. Qureshi, M. Rai, W. H. Sanders, and J. E. Tvedt. (91C01)
IEEE Software, vol. 8, no. 5, Sept. 1991, pp. 6980. [IEEE Xplore entry]
Overview paper on UltraSAN. Provides a basic introduction to the package.
Performability Modeling with UltraSAN.
J. Couvillion, R. Freire, R. Johnson, W. D. Obal II, M. A. Qureshi, M. Rai, W. H. Sanders, and J. E. Tvedt. (91C02, available in hard copy)
Proceedings of the 4th International Workshop on Petri Nets and Performance Models, Melbourne, Australia, December 25, 1991, pp. 290299. [IEEE Xplore entry]
Conference version of above paper.
Reward Model Solution Methods with Impulse and Rate Rewards: An Algorithm and Numerical Results.
M. A. Qureshi. (92Q01)
Master's Thesis, University of Arizona, 1992.
Reward Model Solution Methods with Impulse and Rate Rewards: An Algorithm and Numerical Results.
W. H. Sanders and M. A. Qureshi.
2nd ORSA Telecommunications Conference, Boca Raton, FL, Mar. 1992.
Reward Model Solution Methods with Impulse and Rate Rewards: An Algorithm and Numerical Results.
M. A. Qureshi and W. H. Sanders. (94QUR01)
Performance Evaluation, vol. 20, 1994, pp. 413436.
Presents a method to compute performability distribution of reward models with impulse and rate rewards.
The Effect of Workload on the Performance and Availability of Voting Algorithms.
M. A. Qureshi and W. H. Sanders. (95QUR01)
Proceedings of the International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS '95), Durham, NC, January 1820, 1995, pp. 217224. [IEEE Xplore entry]
Modeling study of voting algorithms.
UltraSAN Version 3: Architecture, Features, and Implementation.
W. H. Sanders, W. D. Obal II, M. A. Qureshi, and F. K. Widjanarko. (95S02)
Proceedings of the AIAA Computing in Aerospace 10 Conference, San Antonio, TX, March 2830, 1995, pp. 327338.
Discussion of the features and architecture of UltraSAN Version 3.0, with an example.
UltraSAN Version 3 Overview.
D. D. Deavours, W. D. Obal II, M. A. Qureshi, W. H. Sanders, and A. P. A. van Moorsel. (95DEA01)
Proceedings of the Sixth International Workshop on Petri Nets and Performance Models, Durham, NC, October 36, 1995, pp. 216217. [IEEE Xplore entry]
A twopage overview of UltraSAN Version 3.0.
Algorithms for the Generation of StateLevel Representations of Stochastic Activity Networks with General Reward Structures.
M. A. Qureshi, W. H. Sanders, A. P. A. van Moorsel, and R. German. (95Q02)
Proceedings of the Sixth International Workshop on Petri Nets and Performance Models, Durham, NC, October 36, 1995, pp. 180190. [IEEE Xplore entry]
This paper discusses the generation of the stochastic process underlying a SAN, including the algorithm for the wellspecified check. Furthermore, a general reward structure is introduced that can represent all reward variables defined on the marking behavior of a SAN.
The UltraSAN Modeling Environment.
W. H. Sanders, W. D. Obal II, M. A. Qureshi, and F. K. Widjanarko. (95S01)
Performance Evaluation, vol. 24, no. 1, OctoberNovember 1995, pp. 89115.
Overview of UltraSAN Version 3.0.
The Effect of Workload on the Performance and Availability of Voting Algorithms.
M. A. Qureshi and W. H. Sanders. (95QUR03)
Microelectronics and Reliability, Special Issue on Performance Modeling and Reliability Analysis, June 1996, vol. 36, no. 6, pp. 757774.
Expected Impulse Rewards in Markov Regenerative Stochastic Petri Nets.
R. German, A. P. A. van Moorsel, M. A. Qureshi, and W. H. Sanders. (95GER01)
Application and Theory of Petri Nets, Proceedings of the 17th International Conference, Osaka, Japan, June 2428, 1996, pp. 172191 (ed. J. Billington and W. Reisig), Lecture Notes in Computer Science, Vol. 1091, SpringerVerlag, 1996.
Computes reward measures for Petri nets with general distributions. Furthermore, the method of supplementary variables is enhanced to derive transient solutions of models with general distributions.
A New Methodology for Calculating Distributions of Reward Accumulated During a Finite Interval.
M. A. Qureshi and W. H. Sanders. (95QUR04)
Proceedings of the 26th International Symposium on FaultTolerant Computing, Sendai, Japan, June 1996, pp. 116125. [IEEE Xplore entry]
This paper presents a new method to compute the distribution of reward accumulated during a finite interval in a Markov reward model. It does this by computing probabilities of particular paths in a uniformized version of the process, and computing the conditional distribution of reward accumulated, given a path.
Algorithms for the Generation of StateLevel Representations of Stochastic Activity Networks with General Reward Structures.
M. A. Qureshi, W. H. Sanders, A. P. A. van Moorsel, and R. German. (95QUR05)
IEEE Transactions on Software Engineering, vol. 22, no. 9, September 1996, pp. 603614. [IEEE Xplore entry]
Same description as for conference version, above.
Overview of UltraSAN.
W. D. Obal II, M. A. Qureshi, D. D. Deavours, and W. H. Sanders. (96OBA01)
Proc. IEEE Int. Performance and Dependability Symposium, Urbana, IL, Sept. 46, 1996. [IEEE Xplore entry]
Construction and Solution of Markov Reward Models.
M. A. Qureshi. (96QUR02)
Doctoral Dissertation, University of Arizona, 1996.
COPYRIGHT NOTICES: The above electronic files are presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
The following copyright notice applies to all of the above items that appear in IEEE publications: "Personal use of this material is permitted. However, permission to reprint/publish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE."
