Trace Semantics for IPDL

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.

[1]  Hirokazu Nishimura.  Descriptively complete process logic , 2004, Acta Informatica.

[2]  Pierre Wolper,et al.  Yet Another Process Logic (Preliminary Version) , 1983, Logic of Programs.

[3]  David Peleg,et al.  Concurrent dynamic logic , 1985, STOC '85.

[4]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[5]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[6]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[7]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[8]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[9]  Johan van Benthem,et al.  Modelling simultaneous games in dynamic logic , 2008, Synthese.

[10]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[11]  David Harel,et al.  Process logic: Expressiveness, decidability, completeness , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .