Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Advanced Parallel Processing Technologies

APPT 2007: Advanced Parallel Processing Technologies pp 600–607Cite as

Parallel First-Order Dynamic Logic and Its Expressiveness and Axiomatization

  • Conference paper

  • 889 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4847))

Abstract

For modeling the parallel actions, the quantified dynamic logic (QDL) is extended to Parallel First-order Dynamic Logic (PaFDL) with parallel action compositions. The composition is introduced as an operator ( on actions in the same syntax as in Peleg’s CQDL but its semantics is defined differently from those of CQDL. The expressive power of PaFDL is proved to be the same as that of QDL. An axiomatic system is given and its first-order soundness and completeness are proved. Compared with other parallel or concurrent Dynamic Logics, PaFDL has a very easy and intuitive understanding for parallel actions as they are in the sequential models.

This work is partially supported by Guangdong Key Laboratory of Information Security.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beckert, B., Schlager, S.: A sequent calculus for first-order dynamic logic with trace modalities. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 626–641. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Balbiani, P.: A new proof of completeness for a relative modal logic with composition and intersection. Journal of Applied Non-Classical Logics 11, 269–280 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Danecki, R.: Nondeterministic propositional dynamic logic with intersection is decidable. In: Skowron, A. (ed.) Computation Theory. LNCS, vol. 208, pp. 34–53. Springer, Heidelberg (1985)

    Google Scholar 

  4. Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18, 194–211 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Groenendijk, J., Stokhof, M.: Dynamic Predicate Logic. Linguistics and Philosophy 14(1), 31–100 (1991)

    Article  Google Scholar 

  6. Harel, D.: Dynamic logic. In: Gabbay, D., Guenthner, F. (eds.) (editors): Handbook of Philosophical Logic, vol. II, pp. 497–604. D. Reidel, Dordrecht (1984)

    Google Scholar 

  7. Harel, D.: First-Order Dynamic Logic. LNCS, vol. 68. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  8. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (Massachusetts) (2000)

    MATH  Google Scholar 

  9. Heisel, M., Reif, W., Stephan, W.: Program verification using dynamic logic. In: Börger, E., Kleine Büning, H., Richter, M.M. (eds.) CSL 1987. LNCS, vol. 329, Springer, Heidelberg (1988)

    Google Scholar 

  10. Kozen, D., Parikh, R.: An elementary proof of the completeness of PDL. Theoretical Computer Science 14, 113–118 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lange, M.: A lower complexity bound for propositional dynamic logic with intersection. In: Schmidt, R., Pratt-Hartmann, I., Reynolds, M., Wansing, H. (eds.) Advances in Modal Logic, vol. 5, pp. 133–147. King’s College Publications, London (2005)

    Google Scholar 

  12. Lange, M., Lutz, C.: 2-EXPTIME lower bounds for propositional dynamic logics with intersection. Journal of Symbolic Logic 70, 1072–1086 (2005)

    MATH  MathSciNet  Google Scholar 

  13. Leivant, D.: Proof Theoretic Methodology for Propositional Dynamic Logic. In: Díaz, J., Ramos, I. (eds.) Formalization of Programming Concepts. LNCS, vol. 107, Springer, Heidelberg (1981)

    Google Scholar 

  14. Nishimura, H.: Sequential method in propositional dynamic logic. Acta Informatica 12, 377–400 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  15. Peleg, D.: Concurrent dynamic logic. Journal of the ACM 34, 450–479 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. David, P.: Communication in Concurrent Dynamic Logic. J. Comput. Syst. Sci. 35, 23–58 (1987)

    Article  MATH  Google Scholar 

  17. Pratt, V.: A near-optimal method for reasoning about action. Journal of Computer and System Sciences 20, 231–254 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pratt, V.: A practical decision method for propositional dynamic logic. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 326–337. ACM Press, New York (1978)

    Google Scholar 

  19. Prendinger, H., Schurz, G.: Reasoning about action and change: A dynamic logic approach. Journal of Logic, Language, and Information 5(2), 209–245 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Science and Technology, Sun Yatsen University, Guangzhou City, 510275, China

    Zhiguo Zhang & Yunfei Jiang

Authors
  1. Zhiguo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunfei Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ming Xu Yinwei Zhan Jiannong Cao Yijun Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Z., Jiang, Y. (2007). Parallel First-Order Dynamic Logic and Its Expressiveness and Axiomatization. In: Xu, M., Zhan, Y., Cao, J., Liu, Y. (eds) Advanced Parallel Processing Technologies. APPT 2007. Lecture Notes in Computer Science, vol 4847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76837-1_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76837-1_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76836-4

  • Online ISBN: 978-3-540-76837-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation