Subject: mu calculus
From: Matthew Morley (matthew@verisity.com)
Date: Wed Feb 07 2001 - 20:59:03 PST
Peter, you asked about the modal mu-calculus. the standard reference
is Kozen's 1983 paper [1], though as a `verification practitioner' i
never found it that illuminating. Streett and Emerson [2] discuss
model checking (the exact complexity of which is still unknown, btw).
a fairly accessible "biography" of the logic has been written by
Bradfield and Stirling [3]:
http://www.dcs.ed.ac.uk/home/jcb/Research/papers.html#HPA-preprint
i recommend that as a starter as it contains all important references.
M
[1] D. Kozen, Results on the propositional mu-calculus. Theoretical
Computer Science 27, 1983.
[2] R.S. Streett, E.A. Emerson, An automata theoretic decision
procedure for the propositional mu-calculus, Information and
Computation 81, 1989.
[3] C. Stirling, J.C. Bradfield, Modal Logics and mu-calculi: an
introduction. Handbook of Process Algebra, Elsevier Science (to
appear).
This archive was generated by hypermail 2b28 : Wed Feb 07 2001 - 21:05:14 PST