199 search results - page 15 / 40 » A Fully Abstract Model for Graph-Interpreted Temporal Logic |
110
Voted
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
104
Voted
FORMATS
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
120
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
123
Voted
EUROCAST
2007
Springer
15 years 5 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...