5255 search results - page 793 / 1051 » Formal Methods for Privacy |
163
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
170
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...
158
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two con...
174
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
The availability is often used to measure how well a system can provide the service continuously. The measures of availability for a single computer and for multiple computers are ...
166
click to vote
IFL
2003
Springer
15 years 11 months ago
2003
Springer
Parallel programming generally requires awareness of the granularity and communication requirements of parallel subtasks, since without precaution, the overhead for parameter and r...