The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudo...
This article describes a process to include in a volumetric model various anatomical and mechanical information provided by different sources. Three stages are described, namely a ...
Maxime Sermesant, Clement Forest, Xavier Pennec, H...
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...