M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: Finite models, complexity, and completeness. Journal of Computer and System Sciences, 25(3):402--417, 1982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... : r l OE) While, by induction hypothesis, for all r 2 P ost(r 2 ; r l ) OE is equivalent to , for some 2 CL( r 2 : r l OE) CL( r 1 r 2 : r l OE) 2 Paths Next we introduce the notion of path, which is similar to the notion of trajectory used in [7], and to that of execution sequence in [119] A path in a structure M is a sequence (s 0 ; s q ) of states of M (q 0) such that for each i = 1; q, s i Gamma1 ; s i ) 2 R a for some a = P j P . The length of (s 0 ; s q ) is q. Intuitively a path describes the sequence ....

....to encode Deterministic PDL formulae in PDL. Though, in this simpler case there is no need of a sophisticated technique, as the one above, to build a model of a Deterministic PDL formula from its PDL counterpart, a standard filtration argument being sufficient. Indeed, the method adopted in [7] to study satisfiability of Deterministic PDL, can be rephrased making use of a mapping similar to fl. Such a formula is a variant of the Converse Deterministic PDL formula A [ P ] P (see for example [131] Note that satisfiability of Converse Deterministic PDL is an EXPTIME complete ....

[Article contains additional citation context not shown here]

M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity, and completeness. Journal of Computer and System Sciences, 25:402--417, 1982.

.... 1995] A sufficient condition for PDL with the addition of a program over a single letter alphabet not to have the finite model property is given in [Harel and Singerman, 1996] Completeness and exponential time decidability for DPDL, Theorem 40 and the upper bound of Theorem 41, are proved in [Ben Ari et al. 1982] and [Valiev, 1980] The lower bound of Theorem 41 is from [Parikh, 1981] Theorems 43 and 44 on SDPDL are from [Halpern and Reif, 1981; Halpern and Reif, 1983] That tests add to the power of PDL is proved in [Berman and Paterson, 1981] It is also known that the test depth hierarchy is ....

M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity and completeness. J. Comput. Syst. Sci., 25:402--417, 1982.

.... graphs deterministic graphs PDL P complete; see e.g. 18] P complete; see e.g. 18] P complete; this P complete; this paper, Corollary 10 paper, Corollary 10 Satisfiability problem non deterministic graphs deterministic graphs PDL EXPTIME complete [22, 40] EXPTIME complete [39, 9] PDL with nominals EXPTIME complete [23] EXPTIME complete [23] CPDL EXPTIME complete [22, 40] EXPTIME complete [44] CPDL with nominals EXPTIME complete [20, 7] open EXPTIME complete; this open paper, Theorem 12 Table 1: A summary of results on logical reasoning tasks. Lemma 13 The problem ....

M. Ben-Ari, J. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity and completeness. Journal of Computer and System Sciences, 25:402--417, 1982.

No context found.

M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: Finite models, complexity, and completeness. Journal of Computer and System Sciences, 25(3):402--417, 1982.

No context found.

Mordechai Ben-Ari, Joseph J. Halpern, and Amir Pnuelu. Deterministic propositional dynamic logic: Finite models, complexity, and completeness. Journal of Computer and System Science, 25:402 - 417, 1982.

No context found.

Ben-Ari, M., Halpern, J., and Pnueli, A.: 1982, Deterministic Propositional Dynamic Logic: Finite Models, Complexity and Completeness, Journal of Computer and System Sciences, 25, pp 402-417.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC