Abstract:
We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the specification and evaluation of arbitrarily nested alternating fixed points. The generality of PDGs subsumes that of similarly proposed models of nested fixed-point computation such as Boolean graphs, Boolean equation systems, and the propositional modal mu-calculus. Our main result is an efficient local algorithm for evaluating PDG fixed points. Our algorithm, which we call LAFP, combines the simplicity of previously proposed induction-based algorithms (such as Winskel's tableau method for nu-calculus model checking) with the efficiency of semantics-based algorithms (such as the bit-vector method of Cleaveland, Klein, and Steffen for the equational mu-calculus). In particular, LAFP is simply specified, we provide a completely rigorous proof of its correctness, and the number of fixed-point iterations required by the algorithm is asymptotically the same as that of the best existing global algorithms. Moreover, preliminary experimental results demonstrate that LAFP performs extremely well in practice. To our knowledge, this makes LAFP the first efficient local algorithm for computing fixed points of arbitrary alternation depth to appear in the literature.
Bibtex Entry:
@inproceedings{LRS:TACAS98, author = {Xinxin Liu and C. R. Ramakrishnan and and Scott A. Smolka}, title = {Fully Local and Efficient Evaluation of Alternating Fixed Points}, booktitle = {Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems ({TACAS})}, address = {Lisbon, Portugal}, month = {April}, series = {Lecture Notes in Computer Science}, volume = {1384}, publisher = {Springer}, pages = {5--19}, year = {1998} }
| Full Paper: | [pdf] |
C. R. Ramakrishnan
(cram@cs.sunysb.edu)