Computation paths logic: An expressive, yet elementary, process logic

David Harel, Eli Singerman
1999 Annals of Pure and Applied Logic  
A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of Harel. Kozen and Parikh. and is close in spirit to the logic R of Hare1 and Peleg. It enjoys most of the advantages of previous process logics. yet is decidable in elementary tlmc. We also ofrcr extensions for modeling asynchronouaisynchronous concurrency and infinite computanons. All extensions are also shown to be decidable in elementary time. :g
doi:10.1016/s0168-0072(98)00038-4 fatcat:4ckozyoo2fddla7ucnhzl6oapq