Computation Paths Logic: An Expressive, yet Elementary, Process Logic

Abstract A new process logic is defined, called computation paths logic (CPL), which treats formulas and programs essentially alike. CPL is a pathwise extension of PDL, following the basic process logic of Harel, Kozen and Parikh and is close in spirit to the logic R of Harel and Peleg. It enjoys most of the advantages of previous process logics, yet is decidable in elementary time. We also offer extensions for modeling asynchronous/synchronous concurrency and infinite computations. All extensions are also shown to be decidable in elementary time.

[1]  David Harel,et al.  Propositional Dynamic Logic of Flowcharts , 1983, FCT.

[2]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

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

[4]  Joseph Y. Halpern.  Deterministic process logic is elementary , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

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

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

[8]  Alain J. Mayer,et al.  The Complexity of Word Problems - This Time with Interleaving , 1994, Inf. Comput..

[9]  Martin Fürer.  The Complexity of the Inequivalence Problem for Regular Expressions with Intersection , 1980, ICALP.

[10]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[11]  Ryszard Danecki,et al.  Nondeterministic Propositional Dynamic Logic with intersection is decidable , 1984, Symposium on Computation Theory.

[12]  Rohit Parikh,et al.  An Elementary Proof of the Completness of PDL , 1981, Theor. Comput. Sci..

[13]  David Harel,et al.  Process Logic: Expressiveness, Decidability, Completeness , 1980, FOCS.

[14]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

[15]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[16]  David Harel,et al.  Looping vs. Repeating in Dynamic Logic , 1982, Inf. Control..

[17]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[18]  Amir Pnueli,et al.  Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL , 1984, SIAM J. Comput..

[19]  David Peleg,et al.  Process Logic with Regular Formulas , 1985, Theor. Comput. Sci..