Skip to main content

On properties preserved by contractions of concurrent systems

  • Conference paper
  • First Online:
Semantics of Concurrent Computation

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 70))

Abstract

We propose a definition of representation map between concurrent systems called a contraction, which is intended to capture the notion of a safe simulation of an abstract by a concrete system. We give several examples and investigate some specific behavioral properties (such as nontermination) which might be preserved by contractions or their inverses. In the second part of the paper, we use model theory to study the decidability properties of the set of sentences preserved by contractions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brand, D. Algebraic simulation between parallel programs. IBM Research Report RC 7206 (June, 1978).

    Google Scholar 

  2. Estrin, G. and Campos, I. Concurrent software design supported by SARA at the age of one. Proc. 3rd Int'l. Conf. on Software Engineering, Atlanta, Ga. May 1978.

    Google Scholar 

  3. Hack, M. Petri net languages. Computation Structures Group Memo 124, Project MAC, MIT, June 1975.

    Google Scholar 

  4. Keller, R.M. Formal verification of parallel programs. Comm. ACM 19 (1976), 371–384.

    Article  Google Scholar 

  5. Kwong, Y.S. On reduction of asynchronous systems. Theoret. Comp. Sci. 5 (1977), 25–50.

    Article  Google Scholar 

  6. Lipton, R. Reduction: a method of proving properties of parallel programs. CACM 12, December 1975, 717–721.

    Google Scholar 

  7. Milner, R. An algebraic definition of simulation between programs. AI Memo 142, Computer Science Department, Stanford University: 1971.

    Google Scholar 

  8. Pratt, V. Semantical consideration on Floyd-Hoare logic. Proc. 17th IEEE Symp. on Foundations of Comp. Sci., Houston, Tx, October 1976.

    Google Scholar 

  9. Riddle, W.E., et al. Behavior modelling during software design. Proc. 3rd Intl. Symp. on Software Engineering, Atlanta, Ga, May 1978.

    Google Scholar 

  10. Riddle, W.E. Hierarchical modelling of operating system structure and behavior. Proc. ACM National Conference, Boston, August 1972, 1105–1127.

    Google Scholar 

  11. Robinson, L., et al. A formal methodology for the design of operating system software. In R. Yeh (ed.), Current Trends in Programming Methodology, Vol. I, Prentice Hall, 1977.

    Google Scholar 

  12. Rogers, H. Certain logical reduction and decision problems. Ann. Math 64 (1956), 264–284.

    Google Scholar 

  13. Rosen, B. Correctness of parallel programs — the Church-Rosser approach. Theoret. Comp. Sci. 2 (1976), 183–207.

    Article  Google Scholar 

  14. Shoenfield, J.R. Mathematical Logic, Addison Wesley, Reading, Ma (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gilles Kahn

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gourlay, J.S., Rounds, W.C., Statman, R. (1979). On properties preserved by contractions of concurrent systems. In: Kahn, G. (eds) Semantics of Concurrent Computation. Lecture Notes in Computer Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022463

Download citation

  • DOI: https://doi.org/10.1007/BFb0022463

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09511-8

  • Online ISBN: 978-3-540-35163-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics