1472 search results - page 185 / 295 » On Model Checking Infinite-State Systems |
122
click to vote
AC
2000
Springer
15 years 1 months ago
2000
Springer
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
119
click to vote
CAV
2004
Springer
15 years 7 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
137
click to vote
DAC
1996
ACM
15 years 6 months ago
1996
ACM
We present a formal verification methodology that we have used on a computer system design project. The methodology integrates a temporal logic model checker with a conventional pr...
105
click to vote
QEST
2007
IEEE
15 years 8 months ago
2007
IEEE
—Performance Trees are a recently-proposed mechanism for the specification of performance properties and measures. They represent an attractive alternative to stochastic logics,...
134
click to vote
ECBS
2007
IEEE
15 years 5 months ago
2007
IEEE
We present in this paper a new approach for the automatic verification and performance analysis of SysML activity diagrams. Since timeliness is important in the design and analysi...