Skip to main content
SpringerLink
Log in

Exponential-Size Model Property for PDL with Separating Parallel Composition

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

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

Abstract

Propositional dynamic logic is extended with a parallel program having a separating semantic: the program \((\alpha \parallel \beta )\) executes \(\alpha \) and \(\beta \) on two substates of the current state. We prove that when the composition of two substates is deterministic, the logic has the exponential-size model property. The proof is by a piecewise filtration using an adaptation of the Fischer-Ladner closure. We conclude that the satisfiability of the logic is decidable in NEXPTIME.

This work was supported by the “French National Research Agency” (DynRes contract ANR-11-BS02-011).

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Abrahamson, K.R.: Modal logic of concurrent nondeterministic programs. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol. 70, pp. 21–33. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  2. Balbiani, P., Boudou, J.: Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization. J. Logic Comput. (2015, to appear)

    Google Scholar 

  3. Balbiani, P., Tinchev, T.: Definability and computability for PRSPDL. In: Advances in Modal Logic, pp. 16–33. College Publications (2014)

    Google Scholar 

  4. Benevides, M.R.F., de Freitas, R.P., Viana, J.P.: Propositional dynamic logic with storing, recovering and parallel composition. ENTCS 269, 95–107 (2011)

    Google Scholar 

  5. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Cardelli, L., Gordon, A.D.: Anytime, anywhere: modal logics for mobile ambients. In: POPL, pp. 365–377. ACM (2000)

    Google Scholar 

  7. Collinson, M., Pym, D.J.: Algebra and logic for resource-based systems modelling. Math. Struct. Comput. Sci. 19(5), 959–1027 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Demri, S., Deters, M.: Separation logics and modalities: a survey. J. Appl. Non Class. Logics 25(1), 50–99 (2015)

    Article  MathSciNet  Google Scholar 

  9. van Ditmarsch, H., van der Hoek, W., Kooi, B.P.: Dynamic Epistemic Logic, vol. 337. Springer Science and Business Media, Heidelberg (2007)

    Book  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Harel, D.: Recurring dominoes: making the highly undecidable highly understandable (preliminary report). In: Budach, L. (ed.) Fundamentals of Computation Theory. LNCS, vol. 158, pp. 177–194. Springer, Heidelberg (1983)

    Google Scholar 

  12. Lange, M., Lutz, C.: 2-exptime lower bounds for propositional dynamic logics with intersection. J. Symb. Log. 70(4), 1072–1086 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Larchey-Wendling, D., Galmiche, D.: The undecidability of boolean BI through phase semantics. In: LICS, pp. 140–149. IEEE Computer Society (2010)

    Google Scholar 

  14. Marx, M., Pólos, L., Masuch, M.: Arrow Logic and Multi-modal Logic. CSLI Publications, Stanford (1996)

    MATH  Google Scholar 

  15. Mayer, A.J., Stockmeyer, L.J.: The complexity of PDL with interleaving. Theor. Comput. Sci. 161(1–2), 109–122 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Peleg, D.: Concurrent dynamic logic. J. ACM 34(2), 450–479 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pym, D.J.: The semantics and proof theory of the logic of bunched implications, Applied Logic Series, vol. 26. Kluwer Academic Publishers (2002)

    Google Scholar 

  18. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS. pp. 55–74. IEEE Computer Society (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT, Toulouse University, Toulouse, France

    Joseph Boudou

Authors
  1. Joseph Boudou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph Boudou .

Editor information

Editors and Affiliations

  1. Università di Roma "Tor Vergata", Rome, Italy

    Giuseppe F Italiano

  2. Università degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

  3. University of Edinburgh, Edinburgh, United Kingdom

    Donald T. Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudou, J. (2015). Exponential-Size Model Property for PDL with Separating Parallel Composition. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48057-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48057-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48056-4

  • Online ISBN: 978-3-662-48057-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation