Probabilistic Veri cation Using
نویسندگان
چکیده
This paper describes and analyzes a probabilistic technique to reduce the memory requirement of the table of reached states maintained in veriication by explicit state enumeration. The memory savings of the new scheme come at the price of a certain probability that the search becomes incomplete. However, this probability can be made negligibly small by using typically 40 bits of memory per state. From this point of view, this new scheme improves substantially on Holzmann's bitstate hashing, which has a high probability of producing an incomplete search even when using close to 1000 bits per state. The proposed scheme has been implemented in the contexts of the SPIN and Mur' veriication systems. Experiments on sample protocols nicely match the predictions of the analysis. For large protocols, memory savings of two orders of magnitude are obtained. We also show how to eeciently combine the new scheme with state space caching, and we analyze bitstate hashing in order to compare it with the new scheme.
منابع مشابه
Improved Probabilistic Veri cation by Hash Compaction
We present and analyze a probabilistic method for veri cation by explicit state enumeration, which improves on the \hashcompact" method of Wolper and Leroy. The hashcompact method maintains a hash table in which compressed values for states instead of full state descriptors are stored. This method saves space but allows a non-zero probability of omitting states during veri cation, which may cau...
متن کاملStop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Currently known basic anonymity techniques depend on identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a general lack of information (e.g. on the Internet), an adversary can participate several times in a communication relationship and observe the honest users. In this paper we focus on the problem of providing anonymity without id...
متن کاملOn the Representation of Probabilities over Structured Domains
In this paper we extend one of the main tools used in veri cation of discrete systems namely Binary Decision Diagrams BDD to treat probabilistic transition systems We show how probabilistic vectors and matrices can be represented canonically and succinctly using proba bilistic trees and graphs and how simulation of large scale probabilistic systems can be performed We consider this work as an i...
متن کاملFormal Veri cation of Performance and Reliability of Real-Time Systems
In this paper we propose a methodology for the speci cation and veri cation of performance and reliability properties of real-time systems within the framework of temporal logic. The methodology is based on the system model of stochastic real-time systems (SRTSs), and on branching-time temporal logics that are extensions of the probabilistic logics pCTL and pCTL*. SRTSs are discrete-time transi...
متن کاملProbabilistic Models for the Veri cation of Human-Computer Interaction
In this paper, we present a method for the formalization of probabilistic models of human-computer interaction (HCI) including user behavior. These models can then be used for the analysis and veri cation of HCI systems with the support of model checking tools. This method allows to answer probabilistic questions like what is the probability that the user will unintentionally send con dential i...
متن کامل