Abstract
Stochastic activity networks have been used since the mid-1980s for performance, dependability, and performability evaluation. They have been used as a modeling formalism in three modeling tools (METASAN, UltraSAN, and Möbius), and have been used to evaluate a wide range of systems. This chapter provides the formal definitions and basic concepts associated with SANs, explaining their behavior and their execution policy precisely.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. F. Meyer, “On evaluating the performability of degradable computing systems,” IEEE Transactions on Computers, vol. C-22,no. 10, pp. 720–731, Aug. 1980.
M.K. Molloy, “Performance analysis using stochastic Petri nets,” IEEE Transactions on Computers, vol. C-31, pp. 913–917, 1982.
G. Florin and S. Natkin, “Les Reseaux de Petri Stochastiques,” Technique et Science Informatiques, vol. 4,no. 1, pp. 143–160, 1985.
B. Beyaert, G. Florin, P. Lonc, and S. Natkin, “Evaluation of computer systems dependability using stochastic Petri nets,” in Proc. 11th Int. Symp. Fault-Tolerant Computing (FTCS-11), Portland, Maine, USA, 1981, pp. 79–81, IEEE Computer Society Press.
W.H. Sanders and J.F. Meyer, “METASAN: A Performability Evaluation Tool Based on Stochastic Activity Networks,” in Proceedings of the IEEE-ACM Fall Joint Computer Conference, Dallas, TX, November 1986, pp. 807–816.
W.H. Sanders, W.D. Obal II, M.A. Qureshi, and F.K. Widjanarko, “The UltraSAN Modeling Environment,” Performance Evaluation, vol. 24,no. 1, pp. 89–115, October-November 1995.
D. Daly, D.D. Deavours, J.M. Doyle, P.G. Webster, and W.H. Sanders, “Mübius: An extensible tool for performance and dependability modeling,” in Computer Performance Evaluation: Modelling Techniques and Tools: Proceedings of the 11th International Conference, TOOLS 2000, B.R. Haverkort, H.C. Bohnenkamp, and C.U. Smith, Eds. vol. 1786 of Lecture Notes in Computer Science, pp. 332–336, Berlin, Springer-Verlag.
W.H. Sanders, “Integrated frameworks for multi-level and multi-formalism modeling,” in Proceedings of PNPM–99: 8th International Workshop on Petri Nets and Performance Models, Zaragoza, Spain, September 1999, pp. 2–9.
J.F. Meyer, A. Movaghar, and W.H. Sanders, “Stochastic activity networks: structure, behavior and application,” Proc. International Workshop on Timed Petri Nets, pp. 106–115, 1985.
A. Movaghar and J.F. Meyer, “Performability modeling with stochastic activity networks,” in Proc. 1984 Real-Time Systems Symposium, Austin, TX, December 1984.
P.S. Thiagarajan, “Elementary net systems,” in Petri nets: central models and their properties, W. Brauer, Ed. 1986, vol. 254 of Lecture Notes in Computer Science, pp. 26–59, Berlin, Springer-Verlag.
A. Movaghar, Performability modeling with stochastic activity networks, Ph.D. thesis, University of Michigan, 1985.
J.L. Peterson, Petri Net Theory and the Modelling of Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, N. Reading, MA, 1980.
W.H. Sanders, Construction and solution of performability models based on stochastic activity networks, Ph.D. thesis, University of Michigan, 1988.
M.A. Qureshi, W.H. Sanders, A.P.A. van Moorsel, and R. German, “Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures,” IEEE Transactions on Software Engineering, vol. 22,no.9, pp. 603–614, Sept. 1996.
D.D. Deavours and W.H. Sanders, “An efficient well-specified check,” in Proceedings of PNPM–99: 8th International Workshop on Petri Nets and Performance Models, Zaragoza, Spain, September 1999, pp. 124–133.
G. Ciardo and R. Zijal, “Well-defined stochastic Petri nets,” in Proceedings of the Fourth International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’96), San Jose, California, Feb. 1996, pp. 278–284.
J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, McGraw-Hill, New York, 1975.
Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill, New York, 1978.
W.H. Sanders and J.F. Meyer, “A unified approach for specifying measures of performance, dependability, and performability,” Dependable Computing and Fault Tolerant Systems, vol. 4, pp. 215–237, 1991.
W.H. Sanders and J.F. Meyer, “Reduced base model construction methods for stochastic activity networks,” IEEE Journal on Selected Areas in Communications, vol. 9,no. 1, pp. 25–36, Jan. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sanders, W.H., Meyer, J.F. (2001). Stochastic Activity Networks: Formal Definitions and Concepts⋆. In: Brinksma, E., Hermanns, H., Katoen, JP. (eds) Lectures on Formal Methods and PerformanceAnalysis. EEF School 2000. Lecture Notes in Computer Science, vol 2090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44667-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-44667-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42479-6
Online ISBN: 978-3-540-44667-5
eBook Packages: Springer Book Archive