Role of genetic testing for inherited prostate cancer risk: Philadelphia prostate cancer consensus conference 2017

Purpose: Guidelines are limited for genetic testing for prostate cancer (PCA). The goal of this conference was to develop an expert consensus-dri

Symbolic methods for the state space exploration of GSPN models

Abstract. Generalised Stochastic Petri Nets (GSPNs) suffer from the same problem as any other state-transition modelling technique: it is difficult to represent sufficient states so that general, real life systems can be analysed. In this paper we use symbolic techniques to perform state space exploration for unstructured GSPNs. We present an algorithm for finding an encoding function which attempts to minimize the height of BDDs used to encode GSPN state spaces. This technique brings together and extends a spectrum of ad-hoc heuristics in a formal algorithm. We also develop a BDD state exploration algorithm which incorporates an adjustable memory threshold. Our results show the ability to encode over 10 8 states using just 13.7MB of memory.

Aerial view of the University of Maryland, June 15, 1957

An aerial photograph of the University of Maryland, College Park campus and surrounding area, College Park, Maryland, June 15, 1957

Data Representation and Efficient Solution: A Decision Diagram Approach

Decision diagrams are a family of data structures that can compactly encode many functions on discrete structured domains, that is, domains that are the cross-product of finite sets. We present some important classes of decision diagrams and show how they can be effectively employed to derive “symbolic” algorithms for the analysis of large discrete-state models. In particular, we discuss both explicit and symbolic algorithms for state-space generation, CTL model-checking, and continuous-time Markov chain solution. We conclude with some suggestions for future research directions

DSSZ-MC – A Tool for Symbolic Analysis of Extended Petri Nets

Abstract. DSSZ-MC supports the symbolic analysis of bounded place/ transition Petri nets extended by read, inhibitor, equal, and reset arcs. No previous knowledge of the precise boundedness degree is required. It contains tools for the efficient analysis of standard properties (bounded-ness, liveness, reversibility) and CTL model checking, built on an object-oriented implementation of Zero-suppressed Binary Decision Diagrams and Interval Decision Diagrams. The main features are saturation-based state space generation, analysis of strongly connected components, dead state analysis with trace generation, and CTL model checking by limited backward reachability analysis. The tool is available for Windows, Linux, and Mac/OS.