Matching logic reachability has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, matching logic reachability provides a language-independent and sound proof system that directly uses the trusted operational semantics of the language as axioms....

The reachability problem for Petri nets is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the reachability set...

BACKGROUND Excessive gestational weight gain (GWG) is associated with pregnancy complications, and Norwegian Health Authorities have adopted the GWG recommendations of the US Institute of Medicine and National Research Council (IOM). The aim of this study was to evaluate if a GWG outside the IOM recommendation in a Norwegian population is associated with increased risk of pregnancy complication...

We generalise Constrained Dynamic Pushdown Networks, introduced by Bouajjani et al., to Constrained Dynamic Tree Networks. In this model, we have trees of processes which may monitor their children. We allow the processes to be defined by any computation model for which the alternating reachability problem is decidable. We address the problem of symbolic reachability analysis for this model. Mo...

Motivated by the objective to further reduce the storage and computation time required by finite-horizon discrete-time optimal reduced-order LQG compensators, this paper introduces the modified reachability canonical form of a minimal finite-horizon discrete-time compensator and an algorithm to compute it. Next recursive algorithms for efficient storage and recovery of the compensator matrices ...

This thesis deals with verification algorithms for inhomogeneous continuous time Markov chains (ICTMC), discrete time stochastic hybrid systems (DTSHS) and Markovian timed automata (MTA). For all of these three models we define the notions of time-bounded and time-unbounded reachability. We use time-bounded and time-unbounded reachability in order to compute the satisfiability probability of an...

1389-1286/$ see front matter 2012 Elsevier B.V http://dx.doi.org/10.1016/j.comnet.2012.08.007 q Preliminary versions of this work, appeared in and in [2]. ⇑ Corresponding author. Tel.: +1 775 327 2246. E-mail addresses: [email protected] (M. research.att.com (K.K. Ramakrishnan), shiv (S. Kalyanaraman), [email protected] (J.D. Ho verizonwireless.com (R. Sadhvani). 1 Dr. Kalyanaraman was with the ...

A quantitative trait locus (QTL) in the nematode C. elegans, "lsq4," was recently implicated by mapping longevity genes. QTLs for lifespan and three stress-resistance traits coincided within a span of <300 kbp, later narrowed to <200 kbp. A single gene in this interval is now shown to modulate all lsq4-associated traits. Full-genome analysis of transcript levels indicates that lsq4 contains a d...

OBJECTIVE To assess periodontal conditions in patients with early stage CLL and to compare it with the periodontal status of age matched healthy controls and to analyze the relationship between periodontal and hematological parameters in CLL patients. MATERIALS AND METHODS 60 subjects were examined: 30 patients with CLL Rai 0 (test group) and 30 age-matching healthy individuals (control group...

BACKGROUND Wilson's disease (WD) is an inherited disorder of copper metabolism leading to liver failure and/or neurological impairment. Its diagnosis often remains difficult even with genetic testing. Relative exchangeable copper (REC) has recently been described as a reliable serum diagnostic marker for WD. METHODOLOGY/PRINCIPAL FINDINGS The aim of this study was to validate the use of REC i...