Simulating concurrent behaviors with worst-case cost bounds

17Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Modern software systems are increasingly being developed for deployment on a range of architectures. For this purpose, it is interesting to capture aspects of low-level deployment concerns in high-level modeling languages. In this paper, an executable object-oriented modeling language is extended with resource-restricted deployment components. To analyze model behavior a formal methodology is proposed to assess resource consumption, which balances the scalability of the method and the reliability of the obtained results. The approach applies to a general notion of resource, including traditional cost measures (e.g., time, memory) as well as concurrency-related measures (e.g., requests to a server, spawned tasks). The main idea of our approach is to combine reliable (but expensive) worst-case cost analysis of statically predictable parts of the model with fast (but inherently incomplete) simulations of the concurrent aspects in order to avoid the state-space explosion. The approach is illustrated by the analysis of memory consumption. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Albert, E., Genaim, S., Gómez-Zamalloa, M., Johnsen, E. B., Schlatte, R., & Tarifa, S. L. T. (2011). Simulating concurrent behaviors with worst-case cost bounds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6664 LNCS, pp. 353–368). https://doi.org/10.1007/978-3-642-21437-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free