Sciweavers

132 search results - page 17 / 27
» Ellipsoidal Techniques for Reachability Analysis
Sort
View
CAV
2007
Springer
112views Hardware» more  CAV 2007»
14 years 2 months ago
Magnifying-Lens Abstraction for Markov Decision Processes
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
Luca de Alfaro, Pritam Roy
ACSAC
2005
IEEE
14 years 2 months ago
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
Steven Noel, Sushil Jajodia
GG
2010
Springer
13 years 8 months ago
Verification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
Barbara König, Javier Esparza
IWEC
2010
13 years 10 months ago
Analyzing Computer Game Narratives
In many computer games narrative is a core component with the game centering on an unfolding, interactive storyline which both motivates and is driven by the game-play. Analyzing n...
Clark Verbrugge, Peng Zhang
COCOON
2001
Springer
14 years 28 days ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer