Verifying temporal properties of finite-state probabilistic programs

Author(s):  
C. Courcoubetis ◽  
M. Yannakakis
Author(s):  
Roman Andriushchenko ◽  
Milan Češka ◽  
Sebastian Junges ◽  
Joost-Pieter Katoen

AbstractThis paper presents a novel method for the automated synthesis of probabilistic programs. The starting point is a program sketch representing a finite family of finite-state Markov chains with related but distinct topologies, and a reachability specification. The method builds on a novel inductive oracle that greedily generates counter-examples (CEs) for violating programs and uses them to prune the family. These CEs leverage the semantics of the family in the form of bounds on its best- and worst-case behaviour provided by a deductive oracle using an MDP abstraction. The method further monitors the performance of the synthesis and adaptively switches between inductive and deductive reasoning. Our experiments demonstrate that the novel CE construction provides a significantly faster and more effective pruning strategy leading to an accelerated synthesis process on a wide range of benchmarks. For challenging problems, such as the synthesis of decentralized partially-observable controllers, we reduce the run-time from a day to minutes.


Author(s):  
Roman Andriushchenko ◽  
Milan Češka ◽  
Sebastian Junges ◽  
Joost-Pieter Katoen ◽  
Šimon Stupinský

AbstractThis paper presents PAYNT, a tool to automatically synthesise probabilistic programs. PAYNT enables the synthesis of finite-state probabilistic programs from a program sketch representing a finite family of program candidates. A tight interaction between inductive oracle-guided methods with state-of-the-art probabilistic model checking is at the heart of PAYNT. These oracle-guided methods effectively reason about all possible candidates and synthesise programs that meet a given specification formulated as a conjunction of temporal logic constraints and possibly including an optimising objective. We demonstrate the performance and usefulness of PAYNT using several case studies from different application domains; e.g., we find the optimal randomized protocol for network stabilisation among 3M potential programs within minutes, whereas alternative approaches would need days to do so.


1993 ◽  
Vol 22 (445) ◽  
Author(s):  
Henrik Reif Andersen

This thesis is concerned with the verification of concurrent systems modelled by process algebras. It provides methods and techniques for reasoning about temporal properties as described by assertions from an expressive modal logic -- the modal µ-calculus. It describes a compositional approach to model checking, efficient local and global algorithms for model checking finite-state systems, a general local fixed-point finding algorithm, a proof system for model checking infinite-state systems, a categorical completeness result for an intuitionistic version of the modal µ-calculus, and finally it shows some novel applications of the logic for expressing behavioural relations.


1995 ◽  
Vol 2 (54) ◽  
Author(s):  
Nils Klarlund ◽  
Mogens Nielsen ◽  
Kim Sunesen

In [14], we proposed a framework for the automatic verification of reactive<br />systems. Our main tool is a decision procedure, Mona, for Monadic<br />Second-order Logic (M2L) on finite strings. Mona translates a formula in<br />M2L into a finite-state automaton. We show in [14] how traces, i.e. finite<br />executions, and their abstractions can be described behaviorally. These<br />state-less descriptions can be formulated in terms of customized temporal<br />logic operators or idioms.<br />In the present paper, we give a self-contained, introductory account of<br />our method applied to the RPC-memory specification problem of the 1994<br />Dagstuhl Seminar on Specification and Refinement of Reactive Systems.<br />The purely behavioral descriptions that we formulate from the informal<br />specifications are formulas that may span 10 pages or more.<br />Such descriptions are a couple of magnitudes larger than usual temporal<br />logic formulas found in the literature on verification. To securely<br />write these formulas, we introduce Fido [16] as a reactive system description<br />language. Fido is designed as a high-level symbolic language for<br />expressing regular properties about recursive data structures.<br />All of our descriptions have been verified automatically by Mona from<br />M2L formulas generated by Fido.<br />Our work shows that complex behaviors of reactive systems can be<br />formulated and reasoned about without explicit state-based programming.<br />With Fido, we can state temporal properties succinctly while enjoying<br />automated analysis and verification.


2020 ◽  
Vol 63 (4) ◽  
pp. 1270-1281
Author(s):  
Leah Fostick ◽  
Riki Taitelbaum-Swead ◽  
Shulamith Kreitler ◽  
Shelly Zokraut ◽  
Miriam Billig

Purpose Difficulty in understanding spoken speech is a common complaint among aging adults, even when hearing impairment is absent. Correlational studies point to a relationship between age, auditory temporal processing (ATP), and speech perception but cannot demonstrate causality unlike training studies. In the current study, we test (a) the causal relationship between a spatial–temporal ATP task (temporal order judgment [TOJ]) and speech perception among aging adults using a training design and (b) whether improvement in aging adult speech perception is accompanied by improved self-efficacy. Method Eighty-two participants aged 60–83 years were randomly assigned to a group receiving (a) ATP training (TOJ) over 14 days, (b) non-ATP training (intensity discrimination) over 14 days, or (c) no training. Results The data showed that TOJ training elicited improvement in all speech perception tests, which was accompanied by increased self-efficacy. Neither improvement in speech perception nor self-efficacy was evident following non-ATP training or no training. Conclusions There was no generalization of the improvement resulting from TOJ training to intensity discrimination or generalization of improvement resulting from intensity discrimination training to speech perception. These findings imply that the effect of TOJ training on speech perception is specific and such improvement is not simply the product of generally improved auditory perception. It provides support for the idea that temporal properties of speech are indeed crucial for speech perception. Clinically, the findings suggest that aging adults can be trained to improve their speech perception, specifically through computer-based auditory training, and this may improve perceived self-efficacy.


Sign in / Sign up

Export Citation Format

Share Document