TY - GEN
T1 - Simulating concurrent behaviors with worst-case cost bounds
AU - Albert, Elvira
AU - Genaim, Samir
AU - Gómez-Zamalloa, Miguel
AU - Johnsen, Einar Broch
AU - Schlatte, Rudolf
AU - Tarifa, S. Lizeth Tapia
PY - 2011/7/11
Y1 - 2011/7/11
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/79959956421
U2 - 10.1007/978-3-642-21437-0_27
DO - 10.1007/978-3-642-21437-0_27
M3 - Conference contribution
AN - SCOPUS:79959956421
SN - 9783642214363
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 353
EP - 368
BT - FM 2011
T2 - 17th International Symposium on Formal Methods, FM 2011
Y2 - 20 June 2011 through 24 June 2011
ER -