ISSN:
1572-8102
Keywords:
Formal methods in system analysis
;
automated verification
;
model-checking algorithms
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We develop a model-checking algorithm for a logic that permits propositions to be defined using greatest and least fixed points of mutually recursive systems of equations. This logic is as expressive as the alternation-free fragment of the modal mu-calculus identified by Emerson and Lei, and it may therefore be used to encode a number of temporal logics and behavioral preorders. Our algorithm determines whether a process satisfies a formula in time proportional to the product of the sizes of the process and the formula; this improves on the best known algorithm for similar fixed-point logics.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01383878
Permalink