A concurrency model is presented, and concurrent events, concurrency blocks, global states, concurrency measures, communication deadlocks, and data races are defined based on the model. The model allows high-level abstractions to be used for understanding concurrent behaviors. Using the concept of concurrency blocks, it is shown how to compute concurrency measures efficiently. The results are applied to the formal description techniques Estelle and LOTOS to reason about and classify their concurrency behaviors. >
['Myungchul Kim', 'Samuel T. Chanson', 'Son T. Vuong']
Concurrency model and its application to formal protocol specifications