Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
We present a new technique for obtaining decision procedures for modal logics of programs. The technique centers around a new class of finite automata on infinite trees for which the emptiness problem can be solved in polynomial time. The decision procedures then consist of constructing an automaton Af for a given formula f such that Af accepts some tree if and only if f is satisfiable. We illustrate our technique by giving exponential decision procedures for several variants of deterministic propositional dynamic logic. © 1986.
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence