Synthesis of Concurrent Systems with Many Similar Processes

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 1, 1998, Pages 51-115

  Attie, Paul C ^a   Allen Emerson, E ^b  

^a The Department of Electrical and Computer Engineering   (United States)

^b University of Texas at Austin   (United States)

Author keywords

C.2.4 Computer Communication Networks : Distributed Systems; D.1.2 Programming Techniques : Automatic Programming; D.1.3 Programming Techniques : Concurrent Programming; D.2.4 Software Engineering : Program Verification

Indexed keywords

CONCURRENT PROGRAMS; PROGRAM SYNTHESIS; TEMPORAL LOGIC;

AUTOMATION; COMPUTER PROGRAMMING; DECISION THEORY; GRAPH THEORY; SYNCHRONIZATION; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; PROGRAM DIAGNOSTICS; SOFTWARE ENGINEERING;

CONCURRENCY CONTROL; COMPUTER PROGRAMMING;

CONCURRENT PROGRAM; PROGRAM SYNTHESIS; PROGRAM VERIFICATION; STATE EXPLOSION PROBLEM;

EID: 0031598901     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/271510.271519     Document Type: Article

References (60)

1. ANUCHITANUKUL, A. AND MANNA, Z. 1994. Realizability and synthesis of reactive modules. In Proceedings of the 6th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, Berlin, 156-169.
2. ATTIE, P. C. 1995. Formal methods for the synthesis of concurrent programs from temporal logic specifications. Ph.D. thesis, Dept. of Computer Sciences, The Univ. of Texas at Austin, Austin, Tex.
3. ATTIE, P. C., SINGH, M., EMERSON, E. A., SHETH, A., AND RUSINKIEWICZ, M. 1996. Scheduling workflows by enforcing intertask dependencies. Distrib. Syst. Eng. J. 3, 222-238. Special Issue on workflows. Extended abstract appeared in the Proceedings of the 19th VLDB Conference, Dublin, Ireland, August, 1993.
4. ATTIE, P. C., SINGH, M., EMERSON, E. A., SHETH, A., AND RUSINKIEWICZ, M. 1996. Scheduling workflows by enforcing intertask dependencies. Distrib. Syst. Eng. J. 3, 222-238. Special Issue on workflows. Extended abstract appeared in the Proceedings of the 19th VLDB Conference, Dublin, Ireland, August, 1993.
5. BACK, R. J. R. AND KURKI-SUONIO, R. 1984. Cooperation in distributed systems using symmetric multiprocess handshaking. Tech. Rep. A34, Åbo Akademi, Åbo, Finland.
6. BACK, R. J. R. AND KURKI-SUONIO, R. 1988. Distributed cooperation with action systems. ACM Trans. Program. Lang. Syst. 10, 4 (Oct.), 513-554.
7. BACK, R. J. R. AND KURKI-SUONIO, R. 1989. Decentralization of process nets with centralized control. Distrib. Comput. 3, 73-87. Conference version in Proceedings of the 2nd ACM Symposium on Principles of Programming Languages, Montreal, Canada, August, 1983.
8. BACK, R. J. R. AND KURKI-SUONIO, R. 1989. Decentralization of process nets with centralized control. Distrib. Comput. 3, 73-87. Conference version in Proceedings of the 2nd ACM Symposium on Principles of Programming Languages, Montreal, Canada, August, 1983.
9. BACK, R. J. R., HARTIKAINEN, E., AND KURKI-SUONIO, R. 1985. Multi-process handshaking on broadcasting networks. Tech. Rep. Ser. A, No. 42, Dept. of Information Processing and Mathematics, Swedish Univ. of Åbo, Åbo, Finland.
10. BAGRODIA, R. 1989. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Trans. Softw. Eng. 15, 9 (Sept.), 1053-1065.
11. BIRMAN, K. AND CLARK, T. 1994. Performance of the Isis distributed computing toolkit. Tech. Rep. TR-94-1432, Dept. of Computer Science, Cornell Univ., Ithaca, N.Y.
12. BROWNE, M. C., CLARKE, E. M., DILL, D. L., AND MISHRA, B. 1986. Automatic verification of sequential circuits using temporal logic. IEEE Trans. Comput. C-35, 12 (Dec.), 1035-1044.
13. BROWNE, M. C., CLARKE, E. M., AND GRUMBERG, O. 1988. Characterizing finite kripke structures in propositional temporal logic. Theor. Comput. Sci. 59, 115-131.
14. BROWNE, M. C., CLARKE, E. M., MISHRA, B., AND DILL, D. L. 1990. Sequential circuit verification using symbolic model checking. In Proceedings of the 27th ACM/IEEE Design Automation Conference. ACM, New York.
15. CHANDY, K. M. AND MISRA, J. 1984. The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6, 4 (Oct.), 632-646.
16. CHANDY, K. M. AND MISRA, J. 1987. Synchronizing asynchronous processes - the committee-coordination problem. Tech. Rep., Dept. of Computer Sciences, The Univ. of Texas at Austin, Austin, Tex.
17. CHANDY, K. M. AND MISRA, J. 1988. Parallel Program Design. Addison-Wesley, Reading, Mass.
18. CHARLESWORTH, A. 1987. The multiway rendezvous. ACM Trans. Program. Lang. Syst. 9, 2 (July), 350-366.
19. CLARKE, E. M. AND GRUMBERG. O. 1987. Avoiding the state explosion problem in temporal logic model checking algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 294-303.
20. CLARKE, E. M., BURCH, J. R., GRUMBERG, O., LONG, D. E., AND MCMILLAN, K. L. 1992. Automatic verification of sequential circuit designs. Phil. Trans. Roy. Soc. series A, 339, 105-120.
21. CLARKE, E. M., EMERSON, E. A., AND SISTLA, P. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2 (Apr.), 244-263. Extended abstract in Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages.
22. CLARKE, E. M., FILKORN, T., AND JHA, S. 1993. Exploiting symmetry in temporal logic model checking. In Proceedings of the 5th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin, 450-462.
23. CLARKE, E. M., GRUMBERG, O., AND BROWNE, M. C. 1986. Reasoning about networks with many identical finite-state processes. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 240-248.
24. CLARKE, E. M., LONG, D., AND MCMILLAN, K. L. 1989. Compositional model checking. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science. IEEE, New York.
25. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall Inc., Englewood Cliffs, N.J.
26. DIJKSTRA, E. W. 1982. Selected Writings on Computing: A Personal Perspective. Springer-Verlag, New York, 188-199.
27. DIJKSTRA, E. W., FEIJEN, W. H. J., AND VAN GASTEREN, A. J. M. 1983. Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16, 217-219.
28. ELMAGARMID, A., Ed. 1992. Database Transaction Models for Advanced Applications. Morgan Kaufmann, San Mateo, Calif.
29. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. V. Leeuwen, Ed. Vol. B, Formal Models and Semantics. The MIT Press/Elsevier, Cambridge, Mass.
30. EMERSON, E. A. AND CLARKE, E. M. 1982. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2, 241-266.
31. EMERSON, E. A. AND LEI, C. 1985. Modalities for model checking: Branching time logic strikes back. Tech. Rep. TR-85-21, Dept. of Computer Sciences, The Univ. of Texas at Austin, Austin, Tex. Oct.
32. EMERSON, E. A. AND SISTLA, A. P. 1993. Symmetry and model checking. In Proceedings of the 5th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 697. Springer-Verlag, Berlin, 463-477.
33. EMERSON, E. A. AND SRINIVASAN, J. 1990. A decidable temporal logic to reason about many processes. In Proceedings of the 9th Annual ACM Symposium on the Principles of Distributed Computing. ACM, New York, 233-246.
34. EMERSON, E. A., MOK, A. K., SISTLA, A. P., AND SRINIVASAN, J. 1993. Quantitative temporal reasoning. Real Time Syst. J. 2, 331-352.
35. EMERSON, E. A., SADLER, T. H., AND SRINIVASAN, J. 1992. Efficient temporal reasoning. J. Logic Comput. 2, 2, 173-210. Extended abstract appears in Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 166-178.
36. EMERSON, E. A., SADLER, T. H., AND SRINIVASAN, J. 1992. Efficient temporal reasoning. J. Logic Comput. 2, 2, 173-210. Extended abstract appears in Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 166-178.
37. FORMAN, I. R. 1987. On the design of large distributed systems. Tech. Rep. STP-098-86, Microelectronics and Computer Tecnology Corporation, Austin, Tex. Jan. A preliminary version appears in the 1st International Conference on Computer Languages, Miami, Fla., Oct., 1986.
38. FORMAN, I. R. 1987. On the design of large distributed systems. Tech. Rep. STP-098-86, Microelectronics and Computer Tecnology Corporation, Austin, Tex. Jan. A preliminary version appears in the 1st International Conference on Computer Languages, Miami, Fla., Oct., 1986.
39. FRANCEZ, N. 1986. Fairness. Springer-Verlag, New York.
40. FRANCEZ, N. AND FORMAN, I. 1996. Interacting Processes, A Multiparty Approach to Coordinated Distributed Programming. ACM Press, New York.
41. FRANCEZ, N., HAILPERN, B. T., AND TAUBENFELD, G. 1986. Script - A communication abstraction mechanism and its verification. Sci. Comput. Program. 6, 1 (Jan.), 35-88.
42. GERMAN, S. M. AND SISTLA, A. P. 1992. Reasoning about systems with many processes. J. ACM 39, 3, 675-735. Conference version appears in IEEE Logic in Computer Science 1987.
43. GERMAN, S. M. AND SISTLA, A. P. 1992. Reasoning about systems with many processes. J. ACM 39, 3, 675-735. Conference version appears in IEEE Logic in Computer Science 1987.
44. HOARE, C. A. R. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10, 576-580, 583.
45. INABA, Y. 1984. An implementation of synthesizing synchronization skeletons using temporal logic specifications. M.S. thesis, Dept. of Computer Sciences, The Univ. of Texas at Austin, Austin, Tex. Completed under the supervision of E. A. Emerson.
46. KATZ, S. 1986. Temporary stability in parallel programs. Tech. Rep., Computer Science Dept., Technion, Haifa, Israel.
47. KLEIN, J. 1991. Advanced rule driven transaction management. In Proceedings of the IEEE COMPCON. IEEE, New York.
48. KNAPP, E. 1987. Deadlock detection in distributed databases. Comput. Surv. 19, 4 (Dec.), 303-328.
49. LYNCH, N. 1981. Upper bounds for static resource allocation in a distributed system. J. Comput. Syst. Sci. 23, 254-278.
50. MANNA, Z. AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6, 1 (Jan.), 68-93. Also appears in Proceedings of the Workshop on Logics of Programs, Yorktown-Heights, N.Y., Springer-Verlag Lecture Notes in Computer Science (1981).
51. MANNA, Z. AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6, 1 (Jan.), 68-93. Also appears in Proceedings of the Workshop on Logics of Programs, Yorktown-Heights, N.Y., Springer-Verlag Lecture Notes in Computer Science (1981).
52. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Hemel Hempstead, U.K.
53. MISHRA, B. AND CLARKE, E. M. 1985. Hierarchical verification of asynchronous circuits using temporal logic. Theor. Comput. Sci. 38, 269-291.
54. NELSON, G. 1989. A generalization of Dijkstra's calculus. ACM Trans. Program. Lang. Syst. 11, 4 (Oct.), 517-561.
55. PNUELI, A. AND ROSNER, R. 1989a. On the synthesis of a reactive module. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages. ACM, New York, 179-190.
56. PNUELI, A. AND ROSNER, R. 1989b. On the synthesis of asynchronous reactive modules. In Proceedings of the 16th ICALP. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, Berlin, 652-671.
57. RAMESH, S. AND MEHNDIRATTA, H. 1987. A methodology for developing distributed programs. IEEE Trans. Softw. Eng. SE-13, 8 (Aug.), 967-976.
58. SRINIVASAN, J. 1991. Reasoning about concurrent programs with simplified temporal logics. Ph.D. thesis, Dept. of Computer Sciences, The Univ. of Texas at Austin, Austin, Tex.
59. STYER, E. AND PETERSON, G. 1988. Improved algorithms for distributed resource allocation. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York.
60. WOLPER, P. 1982. Synthesis of communicating processes from temporal logic specifications. Ph.D. thesis, Stanford Univ., Stanford, Calif.