Skip to main content

Multiple propositional dynamic logic of parallel programs

Extended Abstract

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

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

  • 143 Accesses

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. K. R. Abrahamson, Decidability and Expressiveness of Logics of Processes, Ph. D. Thesis, Technical Report 80-08-01, August 1980, University of Washington, Seattle.

    Google Scholar 

  2. R. Danecki, Multiple Propositional Dynamic Logic of Parallel Programs, Fundamenta Informaticae, to appear.

    Google Scholar 

  3. M. J. Fisher, R. E. Ladner, Propositional Dynamic Logic of Regular Programs, JCSS 18:2 (1979), pp. 194–211.

    Google Scholar 

  4. G. Mirkowska, A. Salwicki, Algorithmic Logic, PWN-Polish Scientific Publishers and D. Reidel Publishing Company 1987.

    Google Scholar 

  5. D. Peleg, Concurrent Dynamic Logic, Proc. STOC'85, pp. 232–239.

    Google Scholar 

  6. A. Salwicki, T. MĂŒldner, On the Algorithmic Properties of Concurrent Programs, in Logic of Programs, Proc., LNCS 125, pp. 169–197, Springer 1981.

    Google Scholar 

  7. R. S. Streett, Propositional Dynamic Logic of Looping and Converse is elementarily decidable, Information and Control 54 (1982) pp. 121–141.

    Google Scholar 

  8. M. O. Rabin, Weakly definable relations and special automata, in: Math. Logic and Found. of Set Theory (Y. Bar-Hillel ed.), pp. 1–23, North-Holland 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michal P. Chytil VĂĄclav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Danecki, R. (1988). Multiple propositional dynamic logic of parallel programs. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017147

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics