Sciweavers

244 search results - page 30 / 49
» Counterexamples in Probabilistic Model Checking
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
Sanity Checks in Formal Verification
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
Orna Kupferman
FOSSACS
2003
Springer
14 years 23 days ago
Model Checking Lossy Channels Systems Is Probably Decidable
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
Nathalie Bertrand, Ph. Schnoebelen
LFCS
2009
Springer
14 years 2 months ago
Temporalization of Probabilistic Propositional Logic
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
Pedro Baltazar, Paulo Mateus
APSEC
2005
IEEE
14 years 1 months ago
Analysis of the Suzuki-Kasami Algorithm with the Maude Model Checker
We report on a case study in which the Maude model checker has been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion p...
Kazuhiro Ogata, Kokichi Futatsugi
IJFCS
2006
119views more  IJFCS 2006»
13 years 7 months ago
Enforcing Concurrent Temporal Behaviors
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
Doron Peled, Hongyang Qu