2872 search results - page 109 / 575 » On (Omega-)Regular Model Checking |
140
Voted
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
120
Voted
FORMATS
2007
Springer
15 years 10 months 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...
118
Voted
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
127
Voted
GLVLSI
2006
IEEE
15 years 9 months ago
2006
IEEE
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
130
Voted
FATES
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...