493 search results - page 64 / 99 » Bounded LTL Model Checking with Stable Models |
ACSD
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
TSP
2008
14 years 9 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
164
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...