Skip to main content
SpringerLink
Log in

Yet another process logic

Preliminary version

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1983)

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

Included in the following conference series:

Abstract

We present a process logic that differs from the one introduced by Harel, Kozen and Parikh in several ways. First, we use the extended temporal logic of Wolper for statements about paths. Second, we allow a “repeat” operator in the programs. This allows us to specify programs with infinite computations. However, we limit the interaction between programs and path statements by adopting semantics similar to the ones used by Nishimura. Also, we require atomic programs to be interpreted as binary relations. We argue that this gives us a more appropriate logic. We have obtained an elementary decision procedure for our logic. The time complexity of the decision procedure is four exponentials in the general case and two exponentials if the logic is restricted to finite paths.

† Research supported by a Weizmann Post-Doctoral Fellewship and AFOSR grant 80-12907. Address: IBM Research Laboratory, 5600 Cottle Rd., San Jose CA 95193.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. J. R. Buchi, “On a Decision Method in Restricted Second Order Arithmetic”, Proc. Internat. Congr. Logic, Method and Philos. Sci. 1960, Stanford University Press, 1962, pp. 1–12.

    Google Scholar 

  2. Y. Choueka, “Theories of Automata on θ-Tapes: A Simplified Approach”, Journal of Computer and System Sciences, 8 (1974), pp. 117–141.

    Google Scholar 

  3. E. A. Emerson, J. Y. Halpern, “Sometimes and Not Never Revisited: On Branching Versus Linear Time”, Proceedings of the 10th Symposium on Principles of Programming Languages, Austin, January 1983.

    Google Scholar 

  4. M. Fisher, R. Ladner, “Propositional Dynamic Logic of Regular Programs”, Journal of Computer and System Sciences, 18(2), 1979, pp. 194–211.

    Google Scholar 

  5. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, “The Temporal Analysis of Fairness”, Seventh ACM Symposium on Principles of Programming Languages, Las Vegas, January 1980, pp. 163–173.

    Google Scholar 

  6. D. Harel, “Two Results on Process Logic”, Information Processing Letters, 8 (1979), pp. 195–198.

    Google Scholar 

  7. D. Harel, D. Kozen, R. Parikh, “Process Logic: Expressiveness, Decidability, Completeness”, Proceedings of the 21st Symposium on Foundations of Computer Science, Syracuse, October 1980, pp. 129–142.

    Google Scholar 

  8. D. Harel, D. Peleg, “Process logic with Regular Formulas”, Technical Report, Bar-Ilan University, Ramat-Gan, Israel, 1982.

    Google Scholar 

  9. H. Nishimura, “Descriptively Complete Process Logic”, Acta Informatica, 14 (1980), pp. 359–369.

    Google Scholar 

  10. R. Parikh, “A Decidability Result for a Second Order Process Logic”, Proceedings 19th IEEE Symposium on Foundations of Computer Science, Ann Arbor, October 1978.

    Google Scholar 

  11. A. Pnueli, “The Temporal Logic of Programs”, Proceedings of the Eighteenth Symposium on Foundations of Computer Science, Providence, November 1977, pp. 46–57.

    Google Scholar 

  12. V.R. Pratt, “Semantical Considerations on Floyd-Hoare Logic”, Proceedings 17th IEEE Symposium on Foundations of Computer Science, Houston, October 1976, pp. 109–121.

    Google Scholar 

  13. V.R. Pratt, “A Practical Decision Method for Propositional Dynamic Logic”, Proceedings 10th ACM Symposium on Theory of Computing, San Diego, May 1979, pp. 326–337.

    Google Scholar 

  14. V.R. Pratt, “Using Graphs to understand PDL”, Proceedings of the Workshop on Logics of Programs, Yorktown-Heights, Springer-Verlag Lecture Notes in Computer Science, vol. 131, Berlin, 1982, pp. 387–396.

    Google Scholar 

  15. R. Streett, “Propositional Dynamic Logic of Looping and Converse”, Proceedings of the 13th Symposium on Theory of Computing, Milwaukee, May 1981, pp. 375–383.

    Google Scholar 

  16. P. Wolper, “Temporal Logic Can Be More Expressive”, Proceedings of the Twenty-Second Symposium on Foundations of Computer Science, Nashville, October 1981, pp. 340–348.

    Google Scholar 

  17. P. Wolper, M. Y. Vardi, A. P. Sistla, “Reasoning about Infinite Computation Paths”, to appear in Proceedings 24th IEEE Symp. on Foundation of Computer Science, Tuscon, Nov. 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, USA

    Moshe Y. Vardi

  2. Bell Laboratories, USA

    Pierre Wolper

  3. Bell Laboratories, 600 Mountain Ave., 07974, Murray Hill, NJ

    Pierre Wolper

Authors
  1. Moshe Y. Vardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Wolper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Clarke Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vardi, M.Y., Wolper, P. (1984). Yet another process logic. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_383

Download citation

  • DOI: https://doi.org/10.1007/3-540-12896-4_383

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12896-0

  • Online ISBN: 978-3-540-38775-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation