320 search results - page 19 / 64 » Coverage Metrics for Temporal Logic Model Checking |
124
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Formal verification based on model checking provides a powerful technology to query qualitative models of dynamical systems. The application of model-checking approaches is hamper...
136
Voted
RTSS
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
218
click to vote
ECCB
2008
IEEE
15 years 2 months ago
2008
IEEE
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
106
Voted
LICS
2002
IEEE
15 years 6 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
102
click to vote
CONCUR
1999
Springer
15 years 6 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...