Sciweavers

1341 search results - page 39 / 269
» Probabilistic Abstraction Hierarchies
Sort
View
TCS
2010
14 years 5 months ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
VIZSEC
2004
Springer
15 years 3 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
ACCV
2010
Springer
14 years 5 months ago
Spatiotemporal Contour Grouping Using Abstract Part Models
Part Models Pablo Sala1 , Diego Macrini2 , and Sven Dickinson1 1 University of Toronto, 2 Queen's University Abstract. In recent work [1], we introduced a framework for modelr...
Pablo Sala, Diego Macrini, Sven J. Dickinson
PE
2011
Springer
214views Optimization» more  PE 2011»
14 years 5 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
LICS
2009
IEEE
15 years 5 months ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi