Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm

Formal Aspects of Computing

Volumn 8, Issue 2, 1996, Pages 127-161

  Stølen, Ketil ^a,b   Dederichs, Frank ^a   Weber, Rainer ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b Institut F ur Informatik   (Germany)

Author keywords

Assumption commitment; Calculus; Dataflow; Decomposition; Refinement; Rely guarantee; Specification; Streams

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FEEDBACK; QUEUEING THEORY; SPECIFICATIONS; THEOREM PROVING;

ASYNCHRONOUS; AUTOMATIC PROVING; DATA FLOW; INTELLIGENT SYSTEM; MODELING; MULTIAGENT SYSTEM; NON DETERMINISM; PRODUCTION RULE; QUEUEING SYSTEM; REFINEMENT; SEMANTICS; SYNCHRONOUS;

COMMUNICATION SYSTEMS;

EID: 0030361596     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01214554     Document Type: Article

References (35)

1. Abadi, M. and Lamport, L.: The existence of refinement mappings. Technical Report 29, Digital, Palo Alto, 1988.
2. Abadi, M. and Lamport, L.: Composing specifications. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Proc. REX Workshop on Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science 430, pages 1-41, 1990.
3. Abadi, M. and Lamport, L.: Conjoining specifications. Technical Report 118, Digital, Palo Alto, 1993.
4. Alpern, B. and Schneider, F. B.: Defining liveness. Information Processing Letters, 21:181-185, 1985.
5. Brock, J. D. and Ackermann, W. B.: Scenarios: A model of non-determinate computation. In J. Diaz and I. Ramos, editors, Proc. Formalization of Programming Concepts, Lecture Notes in Computer Science 107, pages 252-259, 1981.
6. Broy, M., Dederichs, F., Dendorfer, C., Fuchs, M., Gritzner, T. F. and Weber, R.: The design of distributed systems - an introduction to Focus (revised version). Technical Report SFB 342/2/92 A, Technische Universität München, 1993.
7. Barringer, H., Kuiper, R. and Pnueli, A.: Now you may compose temporal logic specifications In Proc. Sixteenth ACM Symposium on Theory of Computing, pages 51-63, 1984.
8. Broy, M.: Towards a design methodology for distributed systems. In M. Broy, editor, Proc. Constructive Methods in Computing Science, Summerschool. Marktoberdorf, pages 311-364. Springer, 1989.
9. Broy, M.: Functional specification of time sensitive communicating systems. In M. Broy, editor, Proc. Programming and Mathematical Method. Summerschool, Marktoberdorf, pages 325-367. Springer, 1992.
10. Broy, M.: A functional rephrasing of the assumption/commitment specification style. Technical Report SFB 342/10/94 A, Technische Universität München, 1994.
11. Broy, M. and Stølen, K.: Specification and refinement of finite dataflow networks - a relational approach. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Proc. FTRTFT'94, Lecture Notes in Computer Science 863, pages 247-267, 1994.
12. Chandy, K. M. and Misra, J.: Parallel Program Design, A Foundation. Addison-Wesley, 1988.
13. Dederichs, F.: Transformation verteilter Systeme: Von applikativen zu prozeduralen Darstellungen. PhD thesis, Technische Universität München, 1992. Also available as SFB-report 342/17/92 A, Technische Universität München.
14. de Roever, W. P.: The quest for compositionality, formal models in programming. In F. J. Neuhold and G. Chroust, editors, Proc. IFIP 85, pages 181-205, 1985.
15. Fuchs, M. and Philipps, J.: Formal development of a production cell in Focus - a case study. In C. Lewerenz and T. Lindner, editors, Formal Development of Reactive Systems: Case Study Production Cell, Lecture Notes in Computer Science 891, pages 187-200. 1995.
16. Hoare, C. A. R.: An axiomatic basis for computer programming. Communications of the ACM, 12:576-583, 1969.
17. Jones, C. B.: Specification and design of (parallel) programs. In R.E.A. Mason, editor, Proc. Information Processing 83, pages 321-331. North-Holland, 1983.
18. Jones, C. B.: Systematic Software Development Using VDM, Second Edition. Prentice-Hall, 1990.
19. Kahn, G.: The semantics of a simple language for parallel programming. In J.L. Rosenfeld, editor, Proc. Information Processing 74, pages 471-475. North-Holland, 1974.
20. Keller, R. M.: Denotational models for parallel programs with indeterminate operators. In E. J. Neuhold, editor, Proc. Formal Description of Programming Concepts, pages 337-366. North-Holland, 1978.
21. Kleene, S. C.: Introduction to Metamathematics. Van Nostrand, 1952.
22. Kahn, G. and MacQueen, D. B.: Corutines and networks of parallel processes. In B. Gilchrist, editor, Proc. Information Processing 77, pages 993-998. North-Holland, 1977.
23. Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, 1974.
24. Misra, J. and Chandy, K. M.: Proofs of networks of processes. IEEE Transactions on Software Engineering, 7:417-426, 1981.
25. Morgan, C.: The specification statement. ACM Transactions on Programming Languages and Systems, 10:403-419, 1988.
26. Owicki, S. and Gries, D.: An axiomatic proof technique for parallel programs. Acta Informatica, 6:319-340, 1976.
27. Pandya, P. K.: Some comments on the assumption-commitment framework for compositional verification of distributed programs. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Proc. REX Workshop on Stepwise Refinement of Distributed Systems. Lecture Notes in Computer Science 430, pages 622-640, 1990.
28. Park, D.: The "fairness" problem and nondeterministic computing networks. In J. W. de Bakker and J van Leeuwen, editors, Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, pages 133-161. Mathematisch Centrum Amsterdam, 1983.
29. Philipps, J.: Spezifikation einer Fertigungszelle - eine Fallstudie in Focus. Master's thesis, Technische Universiät München, 1993.
30. Pandya, P. K. and Joseph, M.: P-A logic - a compositional proof system for distributed programs. Distributed Computing, 5:37-54, 1991.
31. Pnueli, A.: In transition from global to modular temporal reasoning about programs. In K. R. Apt, editor, Proc. Logics and Models of Concurrent Systems, pages 123-144. Springer, 1985.
32. Stølen, K., Dederichs, F. and Weber, R.: Assumption/commitment rules for networks of asynchronously communicating agents. Technical Report SFB 342/2/93 A, Technische Universität München, 1993.
33. Stark, E. W.: A proof technique for rely/guarantee properties. In S. N. Maheshwari, editor, Proc. 5th Conference on the Foundation of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 206, pages 369-391, 1985.
34. Stølen, K.: A method for the development of totally correct shared-state parallel programs. In J. C. M. Baeten and J. F. Groote, editors, Proc. CONCUR'91. Lecture Notes in Computer Science 527, pages 510-525, 1991.
35. Zwiers, J.: Compositionality, Concurrency and Partial Correctness: Proof Theories for Networks of Processes and Their Relationship, Lecture Notes in Computer Science 321. 1989.