Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
We are concerned with the problem of defining a complex, hybrid, agent based discrete system in a modular way. The modularity results from looking at the system from a number of di...
Marek A. Bednarczyk, Wieslaw Pawlowski, Luca Berna...
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...
This paper proposes a new interactive hybrid non-rigid registration framework that combines any intensity-based algorithm with a feature-based component, using an iterative dual e...
Antoine Azar, Chenyang Xu, Xavier Pennec, Nicholas...