Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
Complete lattices and fixed-point theorems.Complete lattices. Least upper bounds and greatest lower bounds. Complete lattices. Some algebraic properties of lattices.Symmetry in lattices. Sublattices. Boolean algebras. Products of lattices. Functional lattices.Fixed-point theorems. Monotonic and continuous mappings. Fixed points of a function.Nested fixed points. Duality. Some properties of fixed points. Fixed points on product lattices. The replacement lemma. Bekiĉ principle. Gauss elimination.Systems of equations. Conway identities. Bibliographical notes and sources. The mu-calculi: Syntax and semantics. mu-calculi. Functional mu-calculi. Fixed-point terms. Syntax. The mu-calculus of fixed-point terms.Semantics. Quotient mu-calculi. Families of interpretations. Variants of fixed-point terms. Powerset interpretations. Alternation-depth hierarchy. Clones in a mu-calculus. A hierarchy of clones. The syntactic hierarchy. The Emerson-Lei hierarchy. Vectorial mu-calculi. Vectorial extension of a mu-calculus. Interpretations of vectorial fixed point terms. The vectorial hierarchy. Vectorial fixed-point terms in normal form.Bibliographic notes and sources. The Boolean mu-calculus. Monotone Boolean functions. Powerset interpretations and the Boolean mu-calculus. The selection property. Finite vectorial fixed-point terms.Infinite vectors of fixed-point terms. Infinite vectors of infinite fixed-point terms. Bibliographic notes and sources. Parity games. Games and strategies. Positional strategies. The mu-calculus of games. Boolean terms for games. Game terms. Games for the mu-calculus. Games for Boolean terms. Games for powerset interpretations. Weak parity games. Bibliographical notes and sources. The mu-calculus on words. Rational languages. Preliminary definitions. Rational languages. Arden's lemma. The mu-calculus of extended languages. Nondeterministic automata. Automata on finite words. Automata on infinite words. Parity automata. Recognizable languages. McNaughton determination theorem. Terms with intersection. The mu-calculus of constrained languages. Duality. Interpretation of terms by constrained languages. Recognizable constrained languages. Bibliographical notes and sources. The mu-calculus over powerset algebras. Powerset algebras. Semi-algebras. Powerset algebras. Logical operations. Modal mu-calculus. Homomorphisms, mu-homomorphisms and bisimulations. Bibliographic notes and sources. The mu-calculus versus automata. Automata over semi-algebras. Informal description. Basic definitions. Hierarchy of indices. Dual automata. Relation to classical automata. Automata in the mu-calculus perspective. The mu-calculus of automata. The interpretations as homomorphism. Equivalences. From fixed point terms to automata. From automata to fxed-point terms. Conclusion. Bibliographic notes and sources. Hierarchy problems. Introduction. The hierarchy of alternating parity tree automata. Games on the binary tree. Alternating automata on trees. A diagonal argument. The hierarchy of Mostowski indices for tree languages. Universal languages. Weak alternating automata. Bibliographical notes and sources. Distributivity and normal form results. The propositional mu-calculus. Guarded terms. Introductory example. Guarded terms. Intersection-free terms. Definition. A syntactic notion of intersection. The powerset construction. The vmu case. The simulation theorem. McNaughton's Theorem revisited. The simulation theorem. The Rabin complementation lemma. Bibliographic notes and sources. Decision problems. Disjunctive mappings.Decidability of emptiness for disjunctive mu-terms. Compact lattices. Disjunctiveness of fixed-points. Emptiness of nondeterministic tree automata. The regularity theorem. The satisfiability over powerset algebras. Bounded decomposition. Tree models. Finite models and decidability. Bibliographic notes and sources. Algorithms. Evaluation of vectoral fixed-point terms. A naive algorithm. Improved algorithms. Winning positions and winning strategies. Computations of winning positions. Computations of winning strategies. Bibliographical notes and sources.
This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way.
This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers.
The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., . However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.
- No. of pages:
- © North Holland 2001
- 7th February 2001
- North Holland
- Hardcover ISBN:
- eBook ISBN:
"....the book is a solid, conceptually and mathematically profound, modern treatment of the subject, worth reading for an audience ranging from graduate students to working mathematicians and computer scientist" --Zentralblatt f. Mathematik
c/o LaBRI Université Bordeaux I 351, cours de la Libération, 33405 Talence, France
Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.