13 research outputs found
Outcome from "rescue clipping" of ruptured intracranial aneurysms during induction anaesthesia and endotracheal intubation.
Input of Nutritionally Rich Organic Matter from the Mississippi River to the Louisiana Coastal Zone
The shows and the flows: materials, markets, and innovation in the US machine tool industry, 1945â1965
The mu-calculus and Model Checking
International audienceThis chapter presents a part of the theory of the mu-calculus that is relevant to the, broadly understood, model-checking problem. The mu-calculus is one of the most important logics in model-checking. It is a logic with an exceptional balance between expressiveness and algorithmic properties. The chapter describes in length the game characterization of the semantics of the mu-calculus. It discusses the theory of the mu-calculus starting with the tree model property, and bisimulation invariance. Then it develops the notion of modal automaton: an automaton-based model behind the mu-calculus. It gives a quite detailed explanation of the satisfiability algorithm, followed by the results on alternation hierarchy, proof systems, and interpolation. Finally, the chapter discusses the relations of the mu-calculus to monadic second-order logic as well as to some program and temporal logics. It also presents two extensions of the mu-calculus that allow us to address issues such as inverse modalities