4340 search results - page 596 / 868 » Formal Methods and Cryptography |
178
click to vote
FORMATS
2007
Springer
16 years 23 days ago
2007
Springer
The basic modal operator bounded until of Metric Temporal Logic (MTL) comes in several variants. In particular it can be strict (when it does not constrain the current instant) or...
139
click to vote
FORMATS
2007
Springer
16 years 23 days ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
157
click to vote
FORMATS
2007
Springer
16 years 23 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
176
click to vote
FORMATS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
175
click to vote
ICA
2007
Springer
16 years 22 days ago
2007
Springer
Functional Data Analysis (FDA) is used for datasets that are more meaningfully represented in the functional form. Functional principal component analysis, for instance, is used to...