119 search results - page 10 / 24 » The Computational Complexity of Hybrid Temporal Logics |
110
click to vote
SACMAT
2010
ACM
15 years 2 months ago
2010
ACM
We show the practical feasibility of monitoring complex security properties using a runtime monitoring approach for metric first-order temporal logic. In particular, we show how ...
NPAR
2004
ACM
15 years 3 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
72
Voted
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
120
Voted
DLT
2009
14 years 7 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...