Skip to main content

Efficient Program Transformers for Translating LCC to PDL

  • Conference paper
  • 1116 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8761))

Abstract

This work proposes an alternative definition of the so-called program transformers, used to obtain reduction axioms in the Logic of Communication and Change. Our proposal uses an elegant matrix treatment of Brzozowski’s equational method instead of Kleene’s translation from finite automata to regular expressions. The two alternatives are shown to be equivalent, with Brzozowski’s method having the advantage of being computationally more efficient.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arden, D.N.: Delayed-logic and finite-state machines. In: SWCT (FOCS), pp. 133–151. IEEE Computer Society (1961)

    Google Scholar 

  2. Baltag, A., Moss, L.S.: Logics for epistemic programs. Synthese 139(2), 165–224 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements and common knowledge and private suspicions. In: Gilboa, I. (ed.) TARK, pp. 43–56. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  4. van Benthem, J.: Logical Dynamics of Information and Interaction. Cambridge University Press (2011)

    Google Scholar 

  5. van Benthem, J., van Eijck, J., Kooi, B.: Logics of communication and change. Information and Computation 204(11), 1620–1662 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. van Benthem, J., Gerbrandy, J., Hoshi, T., Pacuit, E.: Merging frameworks for interaction. Journal of Philosophical Logic 38(5), 491–526 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. van Benthem, J., Kooi, B.: Reduction axioms for epistemic actions. In: Schmidt, R., Pratt-Hartmann, I., Reynolds, M., Wansing, H. (eds.) Advances in Modal Logic (Number UMCS-04-09-01 in Technical Report Series), pp. 197–211. Department of Computer Science, University of Manchester (2004)

    Google Scholar 

  8. Brzozowski, J.A.: Derivatives of regular expressions. Journal of the ACM 11(4), 481–494 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  9. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971)

    Google Scholar 

  10. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Synthese Library Series, vol. 337. Springer (2007)

    Google Scholar 

  11. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about knowledge. The MIT Press, Cambridge (1995)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  13. Kleene, S.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)

    Google Scholar 

  14. Kozen, D.: On kleene algebras and closed semirings. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 26–47. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  15. Parikh, R., Ramanujam, R.: A knowledge based semantics of messages. Journal of Logic, Language and Information 12(4), 453–467 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Pardo, P., Sarrión-Morillo, E., Soler-Toscano, F., Velázquez-Quesada, F.R. (2014). Efficient Program Transformers for Translating LCC to PDL . In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11558-0_18

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11557-3

  • Online ISBN: 978-3-319-11558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics