Filters








61,793 Hits in 4.0 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 study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems.  ...  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 study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems.  ...  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

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.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.  ... 
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.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1007/s10009-014-0344-z fatcat:vulxdvstizftllcwwtickb6hri

Efficient algorithms for verification of equivalences for probabilistic processes [chapter]

Linda Christoff, Ivan Christoff
1992 Lecture Notes in Computer Science  
We show that the time complexity of our algorithms is polynomial with respect to the number of states in the compared processes.  ...  We present algorithms for automatic verification of equivalences between probabilistic processes.  ...  This work was in part supported by the Swedish National Board for Technical Development (STU).  ... 
doi:10.1007/3-540-55179-4_30 fatcat:szdvdmhwpfd2jgieglzd72pmcy

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.  ...  As a final indication of their complexity, we mention that probabilistic programs allow to draw values from parametric probability distributions.  ...  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

Policy modeling and compliance verification in enterprise software systems: A survey

G. Chatzikonstantinou, K. Kontogiannis
2012 2012 IEEE 6th International Workshop on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems (MESOCA)  
Acknowledgements This research has been co-financed by the European Union (European Social Fund ESF) and Greek national funds through the Operational Program "Education and Lifelong Learning" of the National  ...  Investing in knowledge society through the European Social Fund.  ...  : high complexity a mathematical background is required Policy Modeling Policy Compliance Verification Conclusion Future Avenues of Research Classification of the techniques proposed Graphical  ... 
doi:10.1109/mesoca.2012.6392600 dblp:conf/mesoca/ChatzikonstantinouK12 fatcat:2eionmsk3fgvzg2ejpadwv47zq

From software verification to 'everyware' verification

Marta Kwiatkowska
2013 Computer Science - Research and Development  
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  ...  The research involves investigating the fundamentals of quantitative verification, development of algorithms and prototype implementations, and experimenting with case studies.  ...  Probabilistic reachability then refers to the probability of reaching a given set of states and is a key concept for quantitative verification on which verification of more complex properties is based.  ... 
doi:10.1007/s00450-013-0249-1 fatcat:yijv5tfqwjb5rlopsnmy6gpsf4

Analysing Randomized Distributed Algorithms [chapter]

Gethin Norman
2004 Lecture Notes in Computer Science  
However, this comes at a cost: the analysis of such systems become very complex, particularly in the context of distributed computation.  ...  The appeal of randomized algorithms is their simplicity and elegance.  ...  The advantage of this decomposition of the verification problem is that simpler non-probabilistic methods can be used in the majority of the analysis, while the more complex probabilistic verification  ... 
doi:10.1007/978-3-540-24611-4_11 fatcat:beepcl2jabdglhtgijk7frncvm

Complexity of verification and computation for IBC problems

H Woźniakowski
1992 Journal of Complexity  
We therefore switch to the probabilistic case and study the probabilistic complexity of verification as a function of the error tolerance E and the probability of failure 6.  ...  For fixed 6 and small E, the complexity of verification is zero, whereas for fixed E and small 8 the complexity of verification is essentially a function of only 8 and may be exponentially harder than  ...  complexity of the verification problem in the probabilistic setting.  ... 
doi:10.1016/0885-064x(92)90011-y fatcat:yivebjxhnbf4lbnybhboaxr27u

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.  ...  Madhu Sudan's work spans many areas of computer science theory including computational complexity theory, the design of efficient algorithms, algorithmic coding theory, and the theory of program checking  ...  The probabilities above are taken over the probabilistic choices of the verification algorithm V L .  ... 
arXiv:cs/0212056v1 fatcat:5hhycpl7czh2vcefcl7vy4kb4i

Analysing Biochemical Oscillation through Probabilistic Model Checking

Paolo Ballarini, Radu Mardare, Ivan Mura
2009 Electronical Notes in Theoretical Computer Science  
Then we develop a number of (probabilistic) queries that we verify against a Markov chain model of the oscillator, through the probabilistic model checler PRISM.  ...  There are two popular approaches to modelling and verification of biological systems.  ...  Future developments of this work include the extension of the proposed methodology to the verification of more complex biological systems, such as the cell-cycle, a model of which is currently being developed  ... 
doi:10.1016/j.entcs.2009.02.002 fatcat:xvikdggc35etvclo4jld4t3nnu

Integrity Verification ofK-means Clustering Outsourced to Infrastructure as a Service (IaaS) Providers [chapter]

Ruilin Liu, Hui (Wendy) Wang, Philippos Mordohai, Hui Xiong
2013 Proceedings of the 2013 SIAM International Conference on Data Mining  
We develop both probabilistic and deterministic verification methods to catch the incorrect clustering result by the service provider.  ...  To this end, in this paper, we provide a focused study about how to perform integrity verification of the k-means clustering task outsourced to an IaaS provider.  ...  Furthermore, with probabilistic integrity guarantees, the SC-based approach has much lower verification complexity than that of the deterministic approach.  ... 
doi:10.1137/1.9781611972832.70 dblp:conf/sdm/LiuMWX13 fatcat:rjq4sucdkjfjhel2atdxnhmrea

On the Numerical Verification of Probabilistic Rewriting Systems

J.B. Hassen, S. Tahar
2006 Proceedings of the Design Automation & Test in Europe Conference  
We present in this paper a technique for the formal verification of probabilistic systems described in PMAUDE, a probabilistic extension of the rewriting system Maude.  ...  Then we deduce the probabilistic matrix that will be used for the verification in PRISM.  ...  Due to the increasing complexity of those systems, probabilistic formal verification methods [5] are now being deployed.  ... 
doi:10.1109/date.2006.244073 dblp:conf/date/HassenT06 fatcat:tghgzgrf7rcgxbywaqtebfuhre

AuthPDB: Query Authentication for Outsourced Probabilistic Databases [article]

Bo Zhang, Boxiang Dong, Hui Wang
2019 arXiv   pre-print
In this paper, we consider the outsourcing of probabilistic databases, on which query evaluation is of high complexity.  ...  Our empirical results demonstrate the effectiveness and efficiency of our verification methods.  ...  One major challenge of query evaluation on probabilistic databases is its high complexity; the evaluation of some certain types of queries is of #P-complete complexity [5] .  ... 
arXiv:1808.08297v4 fatcat:2vqsk5ekdnfgnar4z34d5734be
« Previous Showing results 1 — 15 out of 61,793 results