Skip to main content

Trace Semantics for IPDL

  • Conference paper
  • First Online:
Logic, Rationality, and Interaction (LORI 2015)

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

Included in the following conference series:

Abstract

Other than relation semantics, IPDL, the extension of PDL with intersection of actions, has a natural trace semantics where the interpretation of an action is a set of sequences of states. IPDL in trace semantics can describe paced concurrent games very well. Surprisingly, IPDL can be reduced to a sublanguage of it in which intersection connects only atomic actions.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van Benthem, J., Ghosh, S., Liu, F.: Modelling simultaneous games in dynamic logic. Synthese 165(2), 247–268 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and control 60(1), 109–137 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560–599 (1984)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Harel, D., Kozen, D., Parikh, R.: Process logic: Expressiveness, decidability, completeness. Journal of Computer and System Sciences 25(2), 144–170 (1982)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  7. Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Prentice Hall (2006)

    Google Scholar 

  8. Milner, R.: A calculus of communicating systems. Springer (1980)

    Google Scholar 

  9. Nishimura, H.: Descriptively complete process logic. Acta Informatica 14(4), 359–369 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Peleg, D.: Concurrent dynamic logic. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 232–239. ACM (1985)

    Google Scholar 

  11. Pnueli, A.: The temporal logic of programs. In: Proceedings of 18th Symposium on Foundations of Computer Science, pp. 46–57 (1977)

    Google Scholar 

  12. Vardi, M., Wolper, P.: Yet another process logic. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 501–512. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fengkui Ju .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ju, F., Cui, N., Li, S. (2015). Trace Semantics for IPDL. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48561-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48560-6

  • Online ISBN: 978-3-662-48561-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics