Springer-Verlag, Stony Brook, New York, August 1992. Faster model checking for the modal mu-calculus. Our algorithm has a better worst-case complexity than the best known algorithm for this logic while performing just as well on certain sublogics as other specialized algorithms. Important for the efficiency is an alternative characterization of formulas in terms of equational systems, which enables the sharing and reuse of intermediate results. The version of this paper that is available is greatly expanded from what appears in the proceedings.
Testing preorders for probabilistic processes.
Finally, we extend our theory of testing to substochastic processes , in which the sum of the probabilities of a process's outgoing transitions may be strictly less than 1, with the deficit representing the process' capacity for undefined behavior . A simple example involving the construction of pipelines from faulty buffer cells is given to illustrate how substochastic processes, and the resulting preorder, can be used to model fault-tolerant systems and to reason about system reliability. M. Stallmann, R. Cleaveland, and P. Hebbar. A Visualization Tool for Graph Algorithms. American Mathematical Society.