Sciweavers

21 search results - page 2 / 5
» Information Hiding in Probabilistic Concurrent Systems
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...
SP
2010
IEEE
210views Security Privacy» more  SP 2010»
13 years 11 months ago
Reconciling Belief and Vulnerability in Information Flow
Abstract—Belief and vulnerability have been proposed recently to quantify information flow in security systems. Both concepts stand as alternatives to the traditional approaches...
Sardaouna Hamadou, Vladimiro Sassone, Catuscia Pal...
FASE
2005
Springer
14 years 29 days ago
Using Scenarios to Predict the Reliability of Concurrent Component-Based Software Systems
Scenarios are a popular means for capturing behavioural requirements of software systems early in the lifecycle. Scenarios show how components interact to provide system level func...
Genaína Nunes Rodrigues, David S. Rosenblum...
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
14 years 1 months ago
A Probabilistic Relational Model for Characterizing Situations in Dynamic Multi-Agent Systems
Abstract. Artificial systems with a high degree of autonomy require reliable semantic information about the context they operate in. State interpretation, however, is a difficult ...
Daniel Meyer-Delius, Christian Plagemann, Georg vo...
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
13 years 12 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro