Filters








76,231 Hits in 2.2 sec

Efficient Probabilistic Model Checking of Systems with Ranged Probabilities [chapter]

Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivančić, Aarti Gupta
2012 Lecture Notes in Computer Science  
We introduce a new technique to model check reachability properties on Interval Discrete-Time Markov Chains (IDTMC).  ...  We compute a sound overapproximation of the probabilities of satisfying a given property where the accuracy is characterized in terms of error bounds.  ...  Although, SMC is efficient, it does not provide a model of the system, and instead considers it as a black-box.  ... 
doi:10.1007/978-3-642-33512-9_10 fatcat:acfaol4nqbewbeszg6yky7snjy

Preface

Christel Baier, Michael Huth, Marta Kwiatkowska, Mark Ryan
1999 Electronical Notes in Theoretical Computer Science  
Additionally, probabilistic verification can provide guarantees that specifications hold with satisfactory probability in cases when conventional property verification, such as model checking, is not feasible  ...  probabilistic languages and logics, to model checking algorithms and  ...  Rajeev Alur pointed out the lack of existing tools in this area and encouraged work on probabilistic on-the-fly model checking.  ... 
doi:10.1016/s1571-0661(05)80593-6 fatcat:kd26dg524fav3acv4lpjuh22ai

Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation [chapter]

Luca de Alfaro, Marta Kwiatkowska, Gethin Norman, David Parker, Roberto Segala
2000 Lecture Notes in Computer Science  
We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic  ...  This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs).  ...  Acknowledgements The authors Kwiatkowska, Norman and Parker are members of the ARC project 1031 Stochastic Modelling and Verification funded by the British Council and DAAD.  ... 
doi:10.1007/3-540-46419-0_27 fatcat:dueiqo6ljvgunbjk2xyhkaaqtq

Advances and challenges of probabilistic model checking

Marta Kwiatkowska, Gethin Norman, David Parker
2010 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
Probabilistic model checking is a powerful technique for formally verifying quantitative properties of systems that exhibit stochastic behaviour.  ...  In this paper, we give a short overview of probabilistic model checking and of PRISM (www.prismmodelchecker.org), currently the leading software tool in this area.  ...  PROBABILISTIC MODEL CHECKING & PRISM Probabilistic model checking is based on the construction and analysis of a probabilistic model.  ... 
doi:10.1109/allerton.2010.5707120 fatcat:bauounyehvelpe4dwjrobeugfe

From software verification to 'everyware' verification

Marta Kwiatkowska
2013 Computer Science - Research and Development  
poor scalability, efficiency and range of scenarios that can be handled.  ...  In this paper we describe the objectives and initial progress of the research aimed at extending the capabilities of quantitative, probabilistic verification to challenging ubiquitous computing scenarios  ...  In order to reason about a broad range of quantitative properties we augment probabilistic models with reward (or cost) information.  ... 
doi:10.1007/s00450-013-0249-1 fatcat:yijv5tfqwjb5rlopsnmy6gpsf4

PRISM: Probabilistic Symbolic Model Checker [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2002 Lecture Notes in Computer Science  
Analysis is performed through model checking such systems against specifications written in the probabilistic temporal logics PCTL and CSL.  ...  PRISM has been successfully used to analyse probabilistic termination, performance, dependability and quality of service properties for a range of systems, including randomized distributed algorithms [  ...  Probabilistic model checking refers to a range of techniques for calculating the likelihood of the occurrence of certain events during the execution of the system, and can be useful to establish properties  ... 
doi:10.1007/3-540-46029-2_13 fatcat:jcm5csu46rhvnfvd63qlpmz2dm

PRISM 2.0: a tool for probabilistic model checking

M. Kwiatkowska, G. Norman, D. Parker
2004 First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.  
This paper gives a brief overview of version 2.0 of PRISM, a tool for the automatic formal verification of probabilistic systems, and some of the case studies to which it has already been applied.  ...  This paper describes the probabilistic model checking tool PRISM.  ...  Probabilistic model checking is an automatic, formal method for establishing the correctness, performance and reliability of systems which exhibit random behaviour.  ... 
doi:10.1109/qest.2004.1348048 dblp:conf/qest/KwiatkowskaNP04 fatcat:lmeds6kb2zbwvix4fh7j7tawwi

Practical Applications of Probabilistic Model Checking to Communication Protocols [chapter]

Marie Duflot, Marta Kwiatkowska, Gethin Norman, David Parker, Sylvain Peyronnet, Claudine Picaronny, Jeremy Sproston
2012 Formal Methods for Industrial Critical Systems  
Probabilistic model checking is a formal verification technique for the analysis of systems that exhibit stochastic behaviour.  ...  It involves the construction of a probabilistic model of some real-life system followed by a mathematical analysis of this model in order to determine useful properties of the original system.  ...  The authors also gratefully acknowledge the contributions of Laurent Fribourg, Thomas Hérault, Richard Lassaigne, Frédéric Magniette and Stéphane Messika, and EPITA for the use of their computing facilities  ... 
doi:10.1002/9781118459898.ch7 fatcat:qewp2kqw5bacfgx7n6th6lzo7a

MULE-Based Wireless Sensor Networks: Probabilistic Modeling and Quantitative Analysis [chapter]

Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, Ilangko Balasingham
2012 Lecture Notes in Computer Science  
The declarative model abstractly captures behavior without committing to specific transitions by means of probability distributions, whereas the operational model is given as a concrete transition system  ...  The probabilistic, declarative model is not used to select transition rules, but to stochastically capture the result of applying rules.  ...  We would like to thank Lucian Bentea for his contribution to this paper, and in particular for his help with the implementation.  ... 
doi:10.1007/978-3-642-30729-4_11 fatcat:ub5pmwmdwvfnhnrp2u6mhb4ycm

Quantitative Analysis With the Probabilistic Model Checker PRISM

Marta Kwiatkowska, Gethin Norman, David Parker
2006 Electronical Notes in Theoretical Computer Science  
We demonstrate the usefulness of probabilistic model checking techniques in detecting flaws and unusual trends, focusing mainly on the quantitative analysis of a range of best, worst and average-case system  ...  PRISM supports a range of probabilistic models and specification languages based on temporal logic, and has been recently extended with costs and rewards.  ...  We begin with a brief introduction to the topic of probabilistic model checking in Section 2.  ... 
doi:10.1016/j.entcs.2005.10.030 fatcat:7noujqsojfezrfrbuwerfmgw2e

PRISM 4.0: Verification of Probabilistic Real-Time Systems [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2011 Lecture Notes in Computer Science  
These include: an extensible toolkit for building, verifying and refining abstractions of probabilistic models; an explicit-state probabilistic model checking library; a discrete-event simulation engine  ...  These model systems exhibiting probabilistic, nondeterministic and real-time characteristics.  ...  For a full list of PRISM contributors, see [16].  ... 
doi:10.1007/978-3-642-22110-1_47 fatcat:y6aqczsj3fhtrcwwwljw5iqqki

Assume-Guarantee Verification for Probabilistic Systems [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker, Hongyang Qu
2010 Lecture Notes in Computer Science  
In addition, the compositional verification method is efficient and fully automated, based on a reduction to the problem of multi-objective probabilistic model checking.  ...  model checked, in PRISM. † Results are maximum probabilities of error so actual values are these subtracted from 1.  ...  We also gratefully acknowledge several useful discussions with Kousha Etessami.  ... 
doi:10.1007/978-3-642-12002-2_3 fatcat:kzcdr7obtjf2fexu66vrlpfp3y

Formal Analysis of a VANET Congestion Control Protocol through Probabilistic Verification

Savas Konur, Michael Fisher
2011 2011 IEEE 73rd Vehicular Technology Conference (VTC Spring)  
Specifically, we formally analyse a specific congestion control protocol for VANETs using a probabilistic model checking technique, and investigate its correctness and effectiveness.  ...  Vehicular ad hoc networks (VANETs), which are a class of Mobile ad hoc networks, have recently been developed as a standard means of communication among moving vehicles.  ...  Using probabilistic model checking we evaluate the correctness and efficiency of the proposed protocol.  ... 
doi:10.1109/vetecs.2011.5956327 dblp:conf/vtc/KonurF11 fatcat:tozxltdlkzgvrlwqoks6m2344i

Model check stochastic supply chains

Li Tan, Shenghan Xu
2008 2008 IEEE International Conference on Information Reuse and Integration  
Our model-checking-based approach leverages benefits of recent advances in symbolic probabilistic model checking to improve the efficiency and scalability of decision procedures.  ...  The framework is based on probabilistic model checking, a formal verification technique for analyzing stochastic systems.  ...  Probabilistic model checking extends classical model checking techniques with the ability of reasoning stochastic behaviors of a system.  ... 
doi:10.1109/iri.2008.4583067 dblp:conf/iri/TanX08 fatcat:lazyx6hvzve3pky2pyiev5vgtq

Formal analysis techniques for gossiping protocols

Rena Bakhshi, Francois Bonnet, Wan Fokkink, Boudewijn Haverkort
2007 ACM SIGOPS Operating Systems Review  
We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them.  ...  We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner.  ...  Approximate and Statistical Probabilistic Model Checking An alternative approach to cope with state explosion for probabilistic systems is found in approximate probabilistic model checking.  ... 
doi:10.1145/1317379.1317385 fatcat:ppg5garcsrbr3b7ugdijxvs3mu
« Previous Showing results 1 — 15 out of 76,231 results