This paper develops a model-checking algorithm for a fragment of the modal mu-calculus and shows how it may be applied to the efficient computation of behavioral relations between processes. The algorithm’s complexity is proportional to the product of the size of the process and the size of the formula, and thus improves on the best existing algorithm for such a fixed point logic. The method for computing preorders that the model checker induces is also more efficient than known algorithms.
CITATION STYLE
Cleaveland, R., & Steffen, B. (1991). Computing behavioural relations, logically. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 510 LNCS, pp. 127–138). Springer Verlag. https://doi.org/10.1007/3-540-54233-7_129
Mendeley helps you to discover research relevant for your work.