Extending Quasar with dynamic tasks computation
Résumé
The inclusion of dynamic tasks modelisation in Quasar, a tool for automatic analysis of concurrent programs, extends its applicative usefulness. However this extension leads to large size models whose processing has to face combinatory explosion of modeling states.
This article is an extension of the paper "Dynamic tasks verification with QUASAR" accepted for publication in the 10th International Conference on Reliable Software Technologies Ada-Europe 2005. It gives some insight into the impact of the way used to name dynamic task in term of state space size by comparing different solutions on several examples.