Skip to main content
SpringerLink
Log in

Descriptively complete process logic

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The main purpose of this paper is to contribute to the development of Pratt's [12, 13] process logic by presenting a modest language for this logic in which some reasonably powerful class of connectives is definable. In particular, Parikh's [8] formidable language SOAPL is shown to be interpretable in our new language. Semantically, Pneuli's [9, 10] temporal semantics is incorporated into that of process logic.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrahamson, K.: Modal logic of concurrent nondeterministic programs. Lecture Notes in Computer Science, Vol. 70, pp. 21–33. Berlin-Heidelberg-New York: Springer 1979

    Google Scholar 

  2. Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. Proceedings 9th Annual Symp. on Theory of Computing, pp. 286–294, Boulder, Colorado, 1977

  3. Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. System Sci. 18, 194–211 (1979)

    Google Scholar 

  4. Gabbay, D., Pneuli, A., Shelah, S., Stavi, Y.: On the temporal analysis of fairness. 7th POPL, pp. 163–173, 1980

  5. Harel, D.: Logics of programs: Axiomatics and descriptive power. MIT, ph. D. thesis, May 1978

  6. Harel, D.: Two results on process logic. Information Processing Lett. 8, 195–198 (1979)

    Google Scholar 

  7. Kamp, J.A.W.: Tense logic and the theory of linear order. University of California, Los Angeles, ph. D. thesis, 1968

    Google Scholar 

  8. Parikh, R.: A decidability result for a second order process logic. Proceedings 19th IEEE Symp. on Foundations of Computer Science, pp. 177–183, Ann Arbor, Michigan, 1978

  9. Pneuli, A.: The temporal logic of programs. Proceedings 18th Annual Symp. on Foundations of Computer Science, pp. 46–57, Providence, Rhode Island, 1977

  10. Pneuli, A.: The temporal semantics of concurrent programs. Lecture Notes in Computer Science, vol. 70, pp. 1–20. Berlin-Heidelberg-New York: Springer 1979

    Google Scholar 

  11. Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. Proceedings 17th IEEE Symp. on Foundations of Computer Science, pp. 109–121, Houston, 1976

  12. Pratt, V.R.: A practical decision method for propositional dynamic logic. Proceedings 10th Annual ACM Symp. on Theory of Computing, pp. 326–337, San Diego, California, 1978

  13. Pratt, V.R.: Process logic. Proceedings 6th Annual ACM Symp. on the Principles of Programming Languages, pp. 93–100, San Antonio, TX, 1979

  14. Rescher, N., Urquhart, A.: Temporal logic. Berlin-Heidelberg-NewYork: Springer 1971

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan

    Hirokazu Nishimura

Authors
  1. Hirokazu Nishimura
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nishimura, H. Descriptively complete process logic. Acta Informatica 14, 359–369 (1980). https://doi.org/10.1007/BF00286492

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation