1472 search results - page 142 / 295 » On Model Checking Infinite-State Systems |
143
click to vote
PTS
2004
15 years 5 months ago
2004
In this paper, we propose two fault models and methods for the derivation of interoperability test suites when the system implementation is given in the form of two deterministic c...
146
click to vote
ASWEC
2007
IEEE
15 years 10 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
140
click to vote
ICECCS
2005
IEEE
15 years 10 months ago
2005
IEEE
To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems’ resources. These permissions rely on certai...
105
click to vote
FMSD
2006
15 years 4 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
112
click to vote
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...