论文信息 - Decision Complexity of Variants of Propositional Dynamic Logic - 字舞流文

Decision Complexity of Variants of Propositional Dynamic Logic

[1] Takayuki Kimura. An algebraic system for process structuring and interprocess communication , 1976, STOC '76.

[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[3] Vaughan R. Pratt. A practical decision method for propositional dynamic logic (Preliminary Report) , 1978, STOC '78.

[4] Mars K. Valiev. On Axiomatization of Deterministic Propositional Dynamic Logic , 1979, MFCS.

[5] Richard E. Ladner,et al. Propositional modal logic of programs , 1977, STOC '77.

[6] Karl R. Abrahamson. Modal Logic of Concurrent Nondeterministic Programs , 1979, Semantics of Concurrent Computation.

[7] Vaughan R. Pratt,et al. A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[8] Antoni W. Mazurkiewicz. Parallel Recursive Program Schemes , 1975, MFCS.

[9] Rohit Parikh. A decidability result for a second order process logic , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).