| S. Berezin, E. Clarke, S. Jha, and W. Marrero. Model checking algorithms for the mu-calculus. Technical Report TR CMU-CS-96-180, Carnegie Mellon University, September 1996. |
No context found.
S. Berezin, E. Clarke, S. Jha, and W. Marrero. Model checking algorithms for the mu-calculus. Technical Report TR CMU-CS-96-180, Carnegie Mellon University, September 1996.
No context found.
Sergey Berezin, Edmund Clarke, Somesh Jha, and Will Marrero. Model checking algorithms for the mu-calculus. In G. Plotkin, Colin P. Stirling, Mads Tofte, and R. Milner, editors, Proof, Language, and Interaction. MIT Press, 2000.
No context found.
Sergey Berezin, Edmund Clarke, Somesh Jha, and Will Marrero. Model checking algorithms for the mu-calculus. Technical Report CMU-CS-96-180, Cargegie Mellon University, September 1996. Also published as [14].
....the direct pre image at each iteration as we did for bisimulation, we compute the set of states from which there is a path to the current state along which the current labeling L(s) changes exactly once. This involves computing another least fixpoint. The details of the algorithm are described in [3]. A more efficient algorithm based on the Paige Tarjan algorithm was found by Groote and Vaandrager [16] that runs in O(mn) time. It is unknown, however, if this algorithm can use BDDs as well. Memory System Access controller Access unit Execute controller Execute unit Pa Pe Figure 4: A CPU ....
S. Berezin, E. Clarke, S. Jha, and W. Marrero. Model checking algorithms for the mu-calculus. Technical Report TR CMU-CS-96-180, Carnegie Mellon University, September 1996.
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