4341 search results - page 253 / 869 » Quantitative Model checking |
112
click to vote
ESEC
1999
Springer
15 years 5 months ago
1999
Springer
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of explicitly modelling fairness constraints is complicated in practice...
125
Voted
CAV
2006
Springer
15 years 4 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
109
click to vote
CORR
2008
Springer
15 years 27 days ago
2008
Springer
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
100
click to vote
ENTCS
2010
15 years 27 days ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
108
click to vote
ENTCS
2006
15 years 25 days ago
2006
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...