150 search results - page 8 / 30 » Symbolic Model Checking for Simply-Timed Systems |
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
CHARME
2001
Springer
13 years 11 months ago
2001
Springer
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
ARTS
1999
Springer
13 years 11 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
CODES
2002
IEEE
14 years 10 days ago
2002
IEEE
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...