## Reasoning about Systems with Many Processes (1992)

Venue: | Journal of the ACM |

Citations: | 130 - 2 self |

### BibTeX

@ARTICLE{German92reasoningabout,

author = {Stevenm German and A. Prasad Sistla},

title = {Reasoning about Systems with Many Processes},

journal = {Journal of the ACM},

year = {1992},

volume = {39},

pages = {675--735}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state processes that communicate using CCS actions. Two models of systems are considered. Systems in the first model consist of a unique contro [ process and an arbitrary number of user processes with identical det-lnitions, For this model, a decision procedure to check whether all the executions of a process satisfy a given specification is presented. This algorithm runs in time double exponential mthe sizes of the control andthe user process definitions. It is also proven that it is decidable whether all the fair executions of a process satisfy a gwen specification. The second model is a special case of the first. In this model, all the processes have identical definitions. For this model, an efficient decision procedure is presented that checks if every execution of a process satisfies a given temporal logic specification. This algorithm runs in time polynomial inthesize of the process definition. Itisshown howtoverify certamglobal properties such as mutual exchrslon and absence of deadlocks. Finally, it is shown how these decision procedures can beusedto reason about certain systems with a communication network,