ISoLA 2012: Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies pp 290-292 | Cite as
Quantitative Modelling and Analysis
Conference paper
Abstract
Quantitative models and quantitative analysis in Computer Science are currently intensively studied, resulting in a revision of the foundation of Computer Science where classical yes/no answers are replaced by quantitative analyses. The potential application areas are huge, e.g., performance analysis, operations research or embedded systems. This field covers extended automata-based models that permit to reasons about quantities. Over the past, one has mainly distinguished between real-time and stochastic extensions of automata.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Čaušević, A., Seceleanu, C., Pettersson, P.: Checking Correctness of Services Modeled as Priced Timed Automata. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part II. LNCS, vol. 7610, pp. 309–323. Springer, Heidelberg (2012)Google Scholar
- 2.Alur, R., Dill, D.: Automata for Modeling Real-Time Systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)Google Scholar
- 3.David, A., Larsen, K.G., Legay, A., Mikučionis, M.: Schedulability of Herschel-Planck Revisited Using Statistical Model Checking. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012, Part II. LNCS, vol. 7610, pp. 294–308. Springer, Heidelberg (2012)Google Scholar
- 4.Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems 5(3), 356–380 (1983)MATHCrossRefGoogle Scholar
- 5.Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: 26th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 327–338. IEEE Computer Society Press (1985)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2012