Filters








753 Hits in 3.6 sec

Measuring Progress of Probabilistic LTL Model Checking

Elise Cormie-Bowins, Franck van Breugel
2012 Electronic Proceedings in Theoretical Computer Science  
Recently, Zhang and Van Breugel introduced the notion of a progress measure for a probabilistic model checker.  ...  Given a linear-time property P and a description of the part of the system that has already been checked, the progress measure returns a real number in the unit interval.  ...  This model checker can check properties, expressed in linear temporal logic (LTL), of Java code containing probabilistic choices.  ... 
doi:10.4204/eptcs.85.3 fatcat:bly4ayyjbzhw5nfwpvl6wcfeti

LTL to Deterministic Emerson-Lei Automata

David Müller, Salomon Sickert
2017 Electronic Proceedings in Theoretical Computer Science  
The construction is implemented in the tool Delag, which we evaluate on several benchmarks of LTL formulas and probabilistic model checking case studies.  ...  We identify two fragments of LTL, for which one can easily construct deterministic automata and show how knowledge of these components can reduce the number of states.  ...  Those results also reflect in the area of probabilistic model checking, where we analysed the IEEE 802.11 Handshaking protocol.  ... 
doi:10.4204/eptcs.256.13 fatcat:yuqy6plainhctau6qr2kkgt3iy

Query-based verification of qualitative trends and oscillations in biochemical systems

Paolo Ballarini, Maria Luisa Guerriero
2010 Theoretical Computer Science  
We introduce a specific modelling convention through which stochastic models of biochemical systems are made suitable to verification of the behavioural queries we define.  ...  Qualitative/quantitative analysis of biochemical systems a b s t r a c t We investigate the application of query-based verification to the analysis of behavioural trends of stochastic models of biochemical  ...  Model-checking algorithms for this quantitative LTL model-checking are based on the ω-automata approach. 1 Details about quantitative LTL model-checking can be found in [2] although the material presented  ... 
doi:10.1016/j.tcs.2010.02.010 fatcat:5erppsuuanaz5bwy5qywep3zma

Automated Verification and Strategy Synthesis for Probabilistic Systems [chapter]

Marta Kwiatkowska, David Parker
2013 Lecture Notes in Computer Science  
Primarily, we focus on the model of Markov decision processes and use property specifications based on probabilistic LTL and expected reward objectives.  ...  Probabilistic model checking is an automated technique to verify whether a probabilistic system, e.g., a distributed network protocol which can exhibit failures, satisfies a temporal logic property, for  ...  Introduction Probabilistic model checking is an automated technique for verifying quantitative properties of stochastic systems.  ... 
doi:10.1007/978-3-319-02444-8_2 fatcat:r7z2eaajvzdw5fvexvg2vcrjg4

Towards model checking of computer games with Java PathFinder

Nastaran Shafiei, Franck van Breugel
2013 2013 3rd International Workshop on Games and Software Engineering: Engineering Computer Games to Enable Positive, Progressive Change (GAS)  
We show that Java source code of computer games can be checked for bugs such as uncaught exceptions by the model checker Java PathFinder (JPF).  ...  To address those two challenges we use our extensions of JPF, jpf-probabilistic and jpf-nhandler.  ...  Acknowledgements The authors would like to thank Chris Kingsley, Daniel Kroening and Peter Mehlitz for discussion and Steven Xu and Xin Zhang for their help with the development of jpfprobabilistic.  ... 
doi:10.1109/gas.2013.6632584 dblp:conf/icse/ShafieiB13 fatcat:l3gk6t5s75gajdbqsu7asjfkdm

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis [article]

Krishnendu Chatterjee and Andreas Gaiser and Jan Křetínský
2013 arXiv   pre-print
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW).  ...  We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions.  ...  The approach for probabilistic model-checking has been to explicitly construct a DRW from the LTL formula.  ... 
arXiv:1304.5281v1 fatcat:cjsj6thfmzdfvmwsjvv7hlhjwu

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis [chapter]

Krishnendu Chatterjee, Andreas Gaiser, Jan Křetínský
2013 Lecture Notes in Computer Science  
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW).  ...  We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions.  ...  The approach for probabilistic model-checking has been to explicitly construct a DRW from the LTL formula.  ... 
doi:10.1007/978-3-642-39799-8_37 fatcat:hl4nmjasujgqtdgmpart3cub2y

Probabilistic Model Checking and Autonomy [article]

Marta Kwiatkowska, Gethin Norman, David Parker
2021 arXiv   pre-print
In this paper, we provide an overview of probabilistic model checking, focusing on models supported by the PRISM and PRISM-games model checkers.  ...  Probabilistic model checking is a technique to automatically verify, for a given temporal logic specification, that a system model satisfies the specification, as well as to synthesise an optimal strategy  ...  DISCLOSURE STATEMENT The authors are not aware of any affiliations, memberships, funding, or financial holdings that might be perceived as affecting the objectivity of this review. LITERATURE CITED  ... 
arXiv:2111.10630v1 fatcat:ckaniytpargkpcug52qvwgh3iy

LTL Model Checking of Interval Markov Chains [chapter]

Michael Benedikt, Rastislav Lenhardt, James Worrell
2013 Lecture Notes in Computer Science  
We give experiments showing that the resulting system gives a practical approach to model checking IMCs.  ...  We consider the problem of computing values for the unknown probabilities in an IMC that maximize the probability of satisfying an ω-regular specification.  ...  To test the effect of our automata translation techniques on the performance of LTL model checking, we consider a simple Probabilistic Broadcast Protocol (PBP) [11] by which nodes in a network propagate  ... 
doi:10.1007/978-3-642-36742-7_3 fatcat:l3mhblxf3nfgrc7tssc2idw6eu

Probabilistic planning with formal performance guarantees for mobile service robots

Bruno Lacerda, Fatma Faruq, David Parker, Nick Hawes
2019 The international journal of robotics research  
The International Journal of Robotics Research XX(X) The International Journal of Robotics Research XX(X) Funding The research leading to these results has received funding from the EU Seventh Framework  ...  This means that in general policy verification (i.e., model checking of C) can be done much quicker than policy generation (i.e., model checking of M).  ...  Conclusions In this paper, we presented an automated framework for deployment of policies for mobile service robots, based on probabilistic model checking techniques.  ... 
doi:10.1177/0278364919856695 fatcat:6nkfgh77fzcvrfimysjfspskwm

Modeling and Analysis of Biological Networks with Model Checking [chapter]

Dragan Bošnački, Ronny S. Mans
2010 Algorithms in Computational Molecular Biology  
We demonstrate the concepts of probabilistic model checking for biological systems using the probabilistic model checking tool Prism.  ...  We show how a specific type of model checking, socalled probabilistic model checking, can be used for such systems.  ... 
doi:10.1002/9780470892107.ch39 fatcat:olopno5u7nhchgyvfkmcc2bw4a

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  ...  Model-based design and verification techniques have proved useful in supporting the design process by detecting and correcting flaws in a number of ubiquitous computing applications, but are limited by  ...  LTL model checking (for DTM-Cs/MDPs) is based on the automata-theoretic approach to non-probabilistic LTL and an exploration of the product construction in order to calculate the probability.  ... 
doi:10.1007/s00450-013-0249-1 fatcat:yijv5tfqwjb5rlopsnmy6gpsf4

Distribution, Approximation and Probabilistic Model Checking

Guillaume Guirado, Thomas Herault, Richard Lassaigne, Sylvain Peyronnet
2006 Electronical Notes in Theoretical Computer Science  
APMC is a model checker dedicated to the quantitative verification of fully probabilistic systems against LTL formulas.  ...  Using a Monte-Carlo method in order to efficiently approximate the verification of probabilistic specifications, it could be used naturally in a distributed framework.  ...  Indeed, we proposed to use approximation to eliminate the space complexity of probabilistic model checking.  ... 
doi:10.1016/j.entcs.2005.10.016 fatcat:vz3doqpytzfm5mrci4emydhwfq

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus GröBer
2008 Logic in Computer Science  
We prove that these two semantics match in the framework of single-clock timed automata (and only in that framework), and prove that the corresponding relaxed model-checking problems are PSPACE-Complete  ...  In this paper, we define two relaxed semantics (one based on probabilities and the other one based on the topological notion of largeness) for LTL over infinite runs of timed automata which rule out unlikely  ...  This fair infinite path π ends up in a BSCC of G b (A). Let π be the shortest prefix of π which ends in this BSCC. Then, as ϕ is prefixindependent, every fair infinite path with prefix π (i.e., in  ... 
doi:10.1109/lics.2008.25 dblp:conf/lics/BaierBBBG08 fatcat:s4nuvm24brbhralnrvii2hhypy

An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols

Douglas Graham, Muffy Calder, Alice Miller
2009 Electronical Notes in Theoretical Computer Science  
We present a technique to tackle the parameterised probabilistic model checking problem for a particular class of randomised distributed systems, which we model as Markov Decision Processes.  ...  We thereby show that a certain class of quantitative LTL properties will hold for a model of a system with any communication graph if it holds for all models of a system with some base graph.  ...  Acknowledgement Douglas Graham was supported by a University of Glasgow scholarship.  ... 
doi:10.1016/j.entcs.2009.08.007 fatcat:a2og4zspgzfa3mgv3zv5ob3pai
« Previous Showing results 1 — 15 out of 753 results