5015 search results - page 301 / 1003 » Model Checking a Path |
167
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...
172
click to vote
VLSID
2001
IEEE
16 years 6 months ago
2001
IEEE
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
170
click to vote
TASE
2008
IEEE
16 years 27 days ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
183
click to vote
PRDC
2007
IEEE
16 years 24 days ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
153
click to vote
FMCAD
2007
Springer
16 years 21 days ago
2007
Springer
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...