Abstract We present , the first model checking tool for probabilistic Pushdown Automata (pPDA) supporting temporal logic specifications. provides a user-friendly probabilistic modeling language with recursion that automatically translates into Probabilistic Operator Precedence Automata (pOPA). pOPA are a class of pPDA that can express all the behaviors of probabilistic programs: sampling, conditioning, recursive procedures, and nested inference queries. On pOPA, can solve reachability queries as well as qualitative and quantitative model checking queries for specifications in Linear Temporal Logic (LTL) and a fragment of Precedence Oriented Temporal Logic (POTL), a logic for context-free properties such as pre/post-conditioning.

The problem of extending model checking from finite state machines to procedural programs has fostered much research toward the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL. Recently, Precedence Oriented Temporal Logic (POTL) has been introduced to specify and prove properties of programs coded trough an Operator Precedence Language (OPL). POTL is complete w.r.t. the FO restriction of the MSO logic previously defined as a logic fully equivalent to OPL. POTL increases NWTL’s expressive power in a perfectly parallel way as OPLs are more powerful that nested words. In this article, we produce a model checker, named POMC, for OPL programs to prove properties expressed in POTL. To the best of our knowledge, POMC is the first implemented and openly available model checker for proving tree-structured properties of recursive procedural programs. We also report on the experimental evaluation we performed on POMC on a nontrivial benchmark.

SUMMARY: The PiSQRD web resource can be used to subdivide protein structures in quasi-rigid dynamical domains. The latter are groups of amino acids behaving as approximately rigid units in the course of protein equilibrium fluctuations. The PiSQRD server takes as input a biomolecular structure and the desired fraction of protein internal fluctuations that must be accounted for by the relative rigid-body motion of the dynamical domains. Next, the lowest energy modes of fluctuation of the protein (optionally provided by the user) are calculated and used to identify the rigid subunits. The resulting optimal subdivision is returned through a web page containing both interactive graphics and detailed data output. AVAILABILITY: The PiSQRD web server, which requires Java, is available free of charge for academic users at http://pisqrd.escience-lab.org.