[go: up one dir, main page]

Skip to main content

Propositional dynamic logic with strong loop predicate

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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. M. J. Fischer, R. E. Ladner, Propositional dynamic logic of regular programs, JCSS 18:2 (1979) 194–211.

    Google Scholar 

  2. D. Harel, Recurring dominoes: Making the highly undecidable highly understandable, Proc. FCT'83, LNCS 158, pp 177–194, (1983) Springer-Verlag.

    Google Scholar 

  3. M. O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. AMS 141 (1969), 1–35.

    Google Scholar 

  4. R. S. Streett, Propositional dynamic logic of looping and converse, Proc. 13th Ann. ACM Symp. on the Theory of Comput., (Milwaukee) 1981, 375–383.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Danecki, R. (1984). Propositional dynamic logic with strong loop predicate. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030342

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics