3224 search results - page 209 / 645 » On Checking Model Checkers |
155
click to vote
RTSS
1997
IEEE
15 years 8 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....
154
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
142
click to vote
SPIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
110
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
Practitioners of formal property verification often work around the capacity limitations of formal verification tools by breaking down properties into smaller properties that ca...
174
click to vote
CAV
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a new statistical approach to analyzing stochastic systems against specifications given in a sublogic of continuous stochastic logic (CSL). Unlike past numeri...