Sciweavers

119 search results - page 1 / 24
» The Computational Complexity of Hybrid Temporal Logics
Sort
View
IGPL
2000
82views more  IGPL 2000»
13 years 4 months ago
The Computational Complexity of Hybrid Temporal Logics
Carlos Areces, Patrick Blackburn, Maarten Marx
TIME
2003
IEEE
13 years 10 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...
CSL
1999
Springer
13 years 9 months ago
A Road-Map on Complexity for Hybrid Logics
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...
Carlos Areces, Patrick Blackburn, Maarten Marx
FROCOS
2005
Springer
13 years 10 months ago
A Complete Temporal and Spatial Logic for Distributed Systems
Abstract. In this paper, we introduce a spatial and temporal logic for reasoning about distributed computation. The logic is a combination of an extension of hybrid logic, that all...
Dirk Pattinson, Bernhard Reus
FORMATS
2010
Springer
13 years 2 months ago
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
Alexandre Donzé, Oded Maler