Advertisement

On locomorphism in analytical equivalence theory

  • Shigeru Igarashi
  • Tetsuya Mizutani
  • Takashi Tsuji
  • Chiharu Hosono
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 792)

Abstract

A v-definable act is a program, logical and procedural at the same time, and also it is very close to a specification. Its semantics called the analytic semantics is given in a completely logical manner. The concept of homomorphism between acts called locomorphism, which is a generalization of equivalence, is introduced. A necessary and sufficient condition for whether or not there exists a morphism between two acts, one parallel and the other sequential, is presented, and some examples are studied.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hoare, C. A. R.: Communicating Sequential Processes, Prentice-Hall International, 1985.Google Scholar
  2. 2.
    Igarashi, S.: An axiomatic approach to the equivalence problems of algorithms with applications, Rep. Comp. Centre Univ. Tokyo, 1 (1968), pp. 1–101.Google Scholar
  3. 3.
    Igarashi, S.: The v-conversion and an analytic semantics, in R. E. A. Mason (ed.), Inf. Proc. 83, Elsevier Science Publishers B.V., IFIP (1983), pp. 769–774.Google Scholar
  4. 4.
    Igarashi, S., Mizutani, T. and Tsuji, T.: An analytical semantics of parallel program processes represented by v-conversion., TENSOR, N. S., 45 (1987), pp. 222–228.Google Scholar
  5. 5.
    Igarashi, S., Mizutani, T. and Tsuji, T.: Specifications of parallel program processes in analytical semantics., TENSOR, N. S., 45 (1987), pp. 240–244.Google Scholar
  6. 6.
    Kröger, F.: Temporal logic of programs, Springer-Verlag, 1987.Google Scholar
  7. 7.
    Lamport, L.: What good is temporal logic?, in R. E. A. Mason (ed.), Inf. Proc. 83, Elsevier Science Publishers B.V., IFIP (1983), pp. 657–668.Google Scholar
  8. 8.
    Loogen, R. and Goltz, U.: Modelling nondeterministic concurrent processes with event structures, Fundamenta Informaticae, XIV (1991), pp. 39–74.Google Scholar
  9. 9.
    Manna, Z. and Pnueli, A.: Completing the temporal picture, Theor. Comp. Sci, 83 (1991), pp. 97–130.CrossRefGoogle Scholar
  10. 10.
    Milner, R.: Communication and Concurrency, Prentice-Hall International, 1989.Google Scholar
  11. 11.
    Mizutani, T., Hosono, C. and Igarashi, S.: Verification of programs using v-definable acts, Computer Software, 2, (1985), pp. 529–538 (in Japanese).Google Scholar
  12. 12.
    Mizutani, T.: An analytical equivalence theory of programs with applications., Ph. D. thesis, Univ. Tsukuba, 1987.Google Scholar
  13. 13.
    Mizutani, T., Igarashi, S. and Tsuji, T.: An analytical equivalence theory of computer programs, in A. Días, J. Echevererría and A. Ibarra (eds.), International symposium on structures in mathematical theories (1990), pp. 199–204.Google Scholar
  14. 14.
    Moszkowski, B. C.: Executing Temporal Logic Programs, Cambridge Univ. Press, 1986.Google Scholar
  15. 15.
    Olderog, E.-R.: Correctness of concurrent processes, Theor. Comp. Sci., 80 (1991), pp. 263–288.CrossRefGoogle Scholar
  16. 16.
    Soundararajan, N.: Denotational semantics of CSP, Theor. Comp. Sci., 33 (1984), pp. 279–304.CrossRefGoogle Scholar
  17. 17.
    Takeuti, G.: Two applications of logic to mathematics, Princeton University Press, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Shigeru Igarashi
    • 1
  • Tetsuya Mizutani
    • 1
  • Takashi Tsuji
    • 1
  • Chiharu Hosono
    • 1
  1. 1.Institute of Information ScienceUniversity of TsukubaTsukubaJapan

Personalised recommendations