Filters








47,073 Hits in 2.5 sec

Probabilistic verification and approximation

Richard Lassaigne, Sylvain Peyronnet
2008 Annals of Pure and Applied Logic  
We show how some simple randomized approximation algorithms can improve the efficiency of verification of such probabilistic specifications and can be implemented in a probabilistic model checker.  ...  We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.apal.2007.11.006 fatcat:kjhhgvh6prglxehlpepy42afju

Probabilistic Verification and Approximation

Richard Lassaigne, Sylvain Peyronnet
2006 Electronical Notes in Theoretical Computer Science  
We show how some simple randomized approximation algorithms can improve the efficiency of verification of such probabilistic specifications and can be implemented in a probabilistic model checker.  ...  We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.entcs.2005.05.031 fatcat:usjmmp4kjzdrnoztoxpskrguka

A Probabilistic and Approximated Approach to Circuit-Based Formal Verification

Sergio Nocco, Stefano Quer, Miroslav N. Velev
2008 Journal on Satisfiability, Boolean Modeling and Computation  
The nature of the estimate, i.e., under-or over-approximation, depends on the problem that is being computed.  ...  ., a formula compact in size but more expressive for the given verification problem.  ...  Among the possible future developments, we envisage the application/integration of the method within alternative verification strategies, such as abstraction and refinement and interpolant-based verification  ... 
doi:10.3233/sat190054 fatcat:paa7uew4nzdfzflblxbe6ijigm

Approximate and Probabilistic Computing: Design, Coding, Verification (Dagstuhl Seminar 15491)

Antonio Filieri, Marta Kwiatkowska, Sasa Misailovic, Todd Mytkowicz, Marc Herbstritt
2016 Dagstuhl Reports  
Millions of people already use software which computes with and reasons about approximate/probabilistic data daily.  ...  and probabilistic systems.  ...  Probabilistic Computing: Design, Coding, Verification PRISM [38] and MRMC [33] .  ... 
doi:10.4230/dagrep.5.11.151 dblp:journals/dagstuhl-reports/FilieriKMM15 fatcat:dao63covdjhflma6fflt3meus4

Verification and Control of Probabilistic Rectangular Hybrid Automata [chapter]

Jeremy Sproston
2015 Lecture Notes in Computer Science  
We highlight the differences between verification and control problems for probabilistic rectangular hybrid automata and the corresponding problems for non-probabilistic rectangular hybrid automata.  ...  Furthermore, we will describe the effect of assumptions on the underlying model of time (discrete or continuous) on the considered verification and control problems.  ...  Approximation with Probabilistic Rectangular Hybrid Automata A well-established approach in the field of modelling and verification is the construction of models that are amenable to verification and that  ... 
doi:10.1007/978-3-319-22975-1_1 fatcat:gaosj6zatramnpqt246wibpt5i

Approximate planning and verification for large markov decision processes

Richard Lassaigne, Sylvain Peyronnet
2012 Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12  
We study the planning and verification problems for very large or infinite probabilistic systems, like Markov Decision Processes (MDPs), from a complexity point of view.  ...  The complexity of the approximation method is independent of the size of the state space and uses only a probabilistic generator of the MDP.  ...  This research was funded by the ANR projects VERAP (ANR-07-SESU-013) and SPADES (08-ANR-SEGI-025).  ... 
doi:10.1145/2245276.2231984 dblp:conf/sac/LassaigneP12 fatcat:g2feqtk5jfd53k2hgznji4busi

Approximate planning and verification for large Markov decision processes

Richard Lassaigne, Sylvain Peyronnet
2014 International Journal on Software Tools for Technology Transfer (STTT)  
We study the planning and verification problems for very large or infinite probabilistic systems, like Markov Decision Processes (MDPs), from a complexity point of view.  ...  The complexity of the approximation method is independent of the size of the state space and uses only a probabilistic generator of the MDP.  ...  This research was funded by the ANR projects VERAP (ANR-07-SESU-013) and SPADES (08-ANR-SEGI-025).  ... 
doi:10.1007/s10009-014-0344-z fatcat:vulxdvstizftllcwwtickb6hri

Approximate Verification of Probabilistic Systems [chapter]

Richard Lassaigne, Sylvain Peyronnet
2002 Lecture Notes in Computer Science  
General methods have been proposed [2, 4] for the model checking of probabilistic systems, where the verification of a probabilistic statement is reduced to the solution of a linear system over the system's  ...  In order to approximate Ô with approximation ratio and confidence ratio AE, we use a sample of size AE Ç´½ ¡ ½ ¾ ¡ÐÓ ½ AE µ. To verify a statement È ÖÓ ℄ , we test whether´ AE µ ¡´½ µ.  ...  General methods have been proposed [2, 4] for the model checking of probabilistic systems, where the verification of a probabilistic statement is reduced to the solution of a linear system over the system's  ... 
doi:10.1007/3-540-45605-8_16 fatcat:ww7jonkecfbhtonqbtdude2di4

Probabilistic Programming: A True Verification Challenge [chapter]

Joost-Pieter Katoen
2015 Lecture Notes in Computer Science  
In this invited talk, I will survey recent progress on the formal semantics and verification of (parametric) probabilistic programs.  ...  Finally, probabilistic programs can be used for approximate computing, e.g., by specifying reliability requirements for programs that allocate data in unreliable memory and use unreliable operations in  ...  This work is funded by the EU FP7-projects SENSATION and MEALS, and the Excellence Initiative of the German federal and state government.  ... 
doi:10.1007/978-3-319-24953-7_1 fatcat:i7bwx2oaufguhpzbedvqoap26m

Improved probabilistic verification by hash compaction [chapter]

Ulrich Stern, David L. Dill
1995 Lecture Notes in Computer Science  
We present and analyze a probabilistic method for verification by explicit state enumeration, which improves on the "hashcompact" method of Wolper and Leroy.  ...  This method saves space but allows a non-zero probability of omitting states during verification, which may cause verification to miss design errors (i.e. verification may produce "false positives").  ...  Furthermore, discussions with Richard Chatwin helped in clarifying some aspects of the analysis of the probabilistic verification scheme.  ... 
doi:10.1007/3-540-60385-9_13 fatcat:4jfj3o7orndqjgbgtkgooj3hai

On the Work of Madhu Sudan: the 2002 Nevalinna Prize Winner [article]

Shafi Goldwasser
2002 arXiv   pre-print
to classifying the complexity of approximation problems.  ...  The first work shows a probabilistic characterization of the class NP -- those sets for which short and easily checkable proofs of membership exist, and demonstrates consequences of this characterization  ...  The probabilities above are taken over the probabilistic choices of the verification algorithm V L .  ... 
arXiv:cs/0212056v1 fatcat:5hhycpl7czh2vcefcl7vy4kb4i

Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC

Marie Duflot, Laurent Fribourg, Thomas Herault, Richard Lassaigne, Frédéric Magniette, Stéphane Messika, Sylvain Peyronnet, Claudine Picaronny
2005 Electronical Notes in Theoretical Computer Science  
In this paper, we analyse the correctness of the CSMA/CD protocol, using techniques from probabilistic model checking and approximate probabilistic model checking.  ...  This paper considers an application of probabilistic model checking techniques to the verification of the IEEE 802.3 CSMA/CD protocol.  ...  Acknowledgement We would like to thank David Parker and Jeremy Sproston for helpful discussions.  ... 
doi:10.1016/j.entcs.2005.04.012 fatcat:wxr6oba4jzewbcaa2yzqz7c5wy

Advances and challenges of quantitative verification and synthesis for cyber-physical systems

Marta Kwiatkowska
2016 2016 Science of Security for Cyber-Physical Systems Workshop (SOSCYPS)  
This paper gives an overview of quantitative verification and synthesis techniques developed for cyber-physical systems, summarising recent achievements and future challenges in this important field.  ...  Since they are increasingly often used in safety-or business-critical contexts, to mention invasive treatment or biometric authentication, there is an urgent need for modelling and verification technologies  ...  Approximate methods. Quantitative verification suffers from state-space explosion and may become infeasible for large systems.  ... 
doi:10.1109/soscyps.2016.7579999 dblp:conf/cpsweek/Kwiatkowska16 fatcat:ugbkizf4xrcgzjvgtutecnepuu

Distribution, Approximation and Probabilistic Model Checking

Guillaume Guirado, Thomas Herault, Richard Lassaigne, Sylvain Peyronnet
2006 Electronical Notes in Theoretical Computer Science  
Using a Monte-Carlo method in order to efficiently approximate the verification of probabilistic specifications, it could be used naturally in a distributed framework.  ...  APMC is a model checker dedicated to the quantitative verification of fully probabilistic systems against LTL formulas.  ...  The method we designed for the distributed and approximate verification of probabilistic systems is completely different since it is naturally a parallel method (due to the use of a Monte-Carlo sampling  ... 
doi:10.1016/j.entcs.2005.10.016 fatcat:vz3doqpytzfm5mrci4emydhwfq

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

Marta Kwiatkowska, Gethin Norman, David Parker
2011 Lecture Notes in Computer Science  
This paper describes a major new release of the PRISM probabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata.  ...  These model systems exhibiting probabilistic, nondeterministic and real-time characteristics.  ...  The authors are part supported by ERC Advanced Grant VERIWARE, EU-FP7 project CONNECT, DARPA/Air Force Research Laboratory contract FA8650-10-C-7077 (PRISMATIC) and EPSRC grant EP/D07956X.  ... 
doi:10.1007/978-3-642-22110-1_47 fatcat:y6aqczsj3fhtrcwwwljw5iqqki
« Previous Showing results 1 — 15 out of 47,073 results