Reasoning About Systems with Many Processes

Journal of the ACM (JACM)

Volumn 39, Issue 3, 1992, Pages 675-735

  German, Steven M ^a   Sistla, A Prasad ^b  

^a VERIZON   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIPROGRAMMING;

CONCURRENT SYSTEMS; MUTUAL EXCLUSION; REASONING;

COMPUTER OPERATING SYSTEMS;

EID: 0026884434     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/146637.146681     Document Type: Article

References (35)

1. APT, K. R., AND KOZEN, D. Limits to automatic program verification. Inf. Proc. Lett. 22, 6 (1986), 307-309.
2. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. Automatic verification of finite state concurrent programs from temporal specifications. ACM Trans. Prog. Lang. Syst. 8, 2 (Apr. 1986), 244-263.
3. CLARKE, E. M., AND GRUMBURG, O. Avoiding the state explosion problem in temporal logic model checking algorithms. In Proceedings of 6th ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 10-12). ACM, New York, 1987, pp. 294-303.
4. CLARKE, E. M., GRUMBERG, O., AND BROWNE, M. Reasoning about networks with many identical finite state processes. In Proceedings of 5th ACM Symposium on Principles of Distributed Computing (Aug.). ACM, New York, 1986, pp. 240-248.
5. EMERSON, E. A., AND LEI, C. L. Modalities for model checking: Branching time strikes back. In Proceedings of 12th ACM Symposium on Principles of Programming Languages (New Orleans, La., Jan. 14-16). ACM, New York, 1985, pp. 84-96.
6. EMERSON, E. A., AND SISTLA, A. P. Deciding full branching time logic. Inf. Cont. 61, 3 (June 1984), 175-201.
7. HALPERN, J., AND VARDI, M. The complexity of reasoning about knowledge and time. In Proceedings of the 18th ACM SIGACT Symposium on Theory of Computing (Berkeley, Calif., May 28-30). ACM, New York, 1986, pp. 304-315.
8. HOPCROFT. J. E., AND ULLMAN, J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.
9. KANELLAKIS, P. C., AND SMOLKA, S. A. On the analysis of cooperation and antagonism in networks of communicating processes. In Proceedings of 4th ACM Symposium on Principles of Distributed Computing (Minaki, Ont., Canada, Aug. 5-7). ACM, New York, 1985, pp. 23-38.
10. KARMARKAR, N. A new polynomial time algorithm for linear programming. In Proceedings of the 16th ACM Symposium on Theory of Computing (Washington, D.C., Apr. 30-May 2). ACM, New York, 1984, pp. 302-311.
11. KARP, R., AND MILLER, R. Parallel program schemata. J. Comput. Syst. Sci. 3. 4 (May 1969), 167-195.
12. KOSARAJU, S. R. Decidability of reachability in vector addition systems. In Proceedings of 14th ACM Symposium on Theory of Computing (San Fransico, Calif., May 5-7). ACM, New York, 1982, pp. 267-281.
13. KURSHAN, R. P., AND MCMILLAN, K. A structural induction theorem for processes. In Proceedings of 8th Annual ACM Symposium on Principles of Distributed Computing (Edmonton, Alberta, Canada, Aug. 14-16). ACM, New York, 1989, pp. 239-248.
14. LADNER, R. E. The complexity of problems in systems of communicating sequential processes. In Proceedings of 11th ACM Symposium on Theory of Computing (Atlanta, Ga., Apr. 30-May 2). ACM, New York, 1979, pp. 214-222.
15. LEHMANN, N. D. Knowledge, common knowledge, and related puzzles. In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 27-29). ACM, New York, 1984, pp. 62-67.
16. LICHENSTEIN, O., AND PNUELI. A. Checking that finite-state concurrent programs satisfy their linear specification. In Proceedings of 12th ACM Annual Symposium on Principles of Programming Languages (New Orleans, La., Jan. 14-16). ACM, New York, 1985, pp. 97-107.
17. LIPTON, R. The reachability problem requires exponential space. Re. Rep. 62, Dept. of Computer Science, Yale Univ., January, 1976.
18. MANNA, Z., AND PNUELI, A. Specification and verification of concurrent programs by V-automata. In Proceedings of 14th Annual ACM Symposium on Principles of Programming Languages (Munich, West Germany, Jan. 21-23). ACM, New York, 1987, pp. 1-12.
19. MAYR, E. An algorithm for the general petri net reachability problem. In Proceedings of 13th Annual ACM Symposium on Theory of Computing. (Milwaukee, Wis., May 11-13). ACM, New York, 1981. pp. 238-246.
20. MILNER, R. A calculus of communicating systems. In Lecture Notes in Computer Science, Vol. 92. Springer-Verlag, New York, 1980.
21. PAPADIMITRIOU, C. H., AND STEIGLITZ, K. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, N.J., 1982.
22. PETERSON, J. Petri Net Theory and the Modeling of Systems Prentice-Hall, Englewood Cliffs, N.J., 1981.
23. PETRI, C. Fundamentals of a theory of asynchronous information flow. In Information Processing 62, Proceedings of the 1962 IFIP Congress. North-Holland, Amsterdam, The Netherlands, 1962, pp. 386-390.
24. RACKOFF, C. The covering and boundedness problem for VAS. Theoret. Comput. Sci. 6 (1978) 223-231.
25. REIF, J., AND SISTLA, A. P. A multiprocess network logic with temporal and spatial modalities. J. Comput. Syst. Sci. 30. 1 (Feb 1985), 41-53.
26. ROSIER, L., AND YEN, H. A multi-parameter analysis of the boundedness problem for VAS. J. Comput. Syst. Sci. 32 (1986), 105-135.
27. SAVITCH, W. J. Relationship between non-deterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4. 2 (1970), 177-192.
28. SISTLA, A. S. Theoretical issues in the design and verification of distributed systems. Ph.D. dissertation. Harvard Univ., Cambridge, Mass. 1983.
29. SISTLA, A. P., AND CLARKE, E. M. The complexity of propositional linear temporal logics. J. ACM 32 (1985), 733-749.
30. SISTLA, A. P., AND GERMAN, S. S. Reasoning with many processes. In Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (June). IEEE, New York, 1987, pp. 138-152.
31. SISTLA, A. P., AND GERMAN, S. M. Reasoning with many processes Tech. Note. GTE Laboratories, Inc., 1987, (available on request from the authors).
32. SISTLA, A. P., VARDI, M., AND WOLPER. P. Complementation problem for Buchi automaton and its applications to temporal logic. Theoret. Comput. Sci. 49, 2, 3 (1987), 217-237.
33. VARDI, M., AND WOLPER. P. An automata theoretic approach to automatic program verification. In Proceedings of 1st IEEE Symposium on Logic in Computer Science (June). IEEE, New York, 1986.
34. VARDI, M., WOLPER, P., AND SISTLA, A. P. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (Tucson, Az.). IEEE, New York, 1983, pp. 185-194.
35. WOLPER, P., AND LOVINFOSSE, V. Verifying properties of large sets of processes with network invariants (preliminary Draft). In Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems. Grenoble, France, June, 1989.