%0 Journal Article %1 146681 %A German, Steven M. %A Sistla, A. Prasad %C New York, NY, USA %D 1992 %I ACM %J J. ACM %K concurrency decidability parameterized verification %N 3 %P 675--735 %R http://doi.acm.org/10.1145/146637.146681 %T Reasoning about systems with many processes %U http://portal.acm.org/citation.cfm?id=146681 %V 39 %X 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 control process and an arbitrary number of user processes with identical definitions. 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 in the sizes of the control and the user process definitions. It is also proven that it is decidable whether all the fair executions of a process satisfy a given 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 in the size of the process definition. It is shown how to verify certain global properties such as mutual exclusion and absence of deadlocks. Finally, it is shown how these decision procedures can be used to reason about certain systems with a communication network.

@article{146681, 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 control process and an arbitrary number of user processes with identical definitions. 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 in the sizes of the control and the user process definitions. It is also proven that it is decidable whether all the fair executions of a process satisfy a given 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 in the size of the process definition. It is shown how to verify certain global properties such as mutual exclusion and absence of deadlocks. Finally, it is shown how these decision procedures can be used to reason about certain systems with a communication network.}, added-at = {2010-01-15T15:22:57.000+0100}, address = {New York, NY, USA}, author = {German, Steven M. and Sistla, A. Prasad}, biburl = {https://www.bibsonomy.org/bibtex/2c72f444277d712b3da162eb83da5fd30/giuliano.losa}, description = {Reasoning about systems with many processes}, doi = {http://doi.acm.org/10.1145/146637.146681}, interhash = {33269431190c510707dc367ef9fe5236}, intrahash = {c72f444277d712b3da162eb83da5fd30}, issn = {0004-5411}, journal = {J. ACM}, keywords = {concurrency decidability parameterized verification}, number = 3, pages = {675--735}, publisher = {ACM}, timestamp = {2010-01-15T15:22:58.000+0100}, title = {Reasoning about systems with many processes}, url = {http://portal.acm.org/citation.cfm?id=146681}, volume = 39, year = 1992 }