Sciweavers

30 search results - page 5 / 6
» Increasing the Robustness of Bounded Model Checking by Compu...
Sort
View
AAAI
2006
13 years 6 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
SPIN
2007
Springer
13 years 11 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
EPEW
2010
Springer
13 years 5 months ago
Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
Ricardo J. Rodríguez, Jorge Júlvez
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
13 years 10 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
QEST
2008
IEEE
13 years 11 months ago
Symbolic Magnifying Lens Abstraction in Markov Decision Processes
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
Pritam Roy, David Parker, Gethin Norman, Luca de A...