We introduce the problem of Model Repair for Probabilistic Systems as follows. Given a probabilistic system M and a probabilistic temporal logic formula φ such that M fails to satisfy φ, the Model Repair problem is to find an M ′ that satisfies φ and differs from M only in the transition flows of those states in M that are deemed controllable. Moreover, the cost associated with modifying M ’s t...

Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agents in the system. An example is the property “at least m agents know that at most n agents know φ”. We present Epistemic Logic with Quantification over Coalitions (ELQC), where the standard common knowledge operator has...

Partial Order Reduction (POR) techniques improve the basic model checking algorithm by reducing the numbers of states and transitions explored in verifying a property of the model. In the “ample set” POR framework for the verification of an LTL −X formula φ, one associates to each state s a subset Ts of the set of all transitions enabled at s. The approach requires that whenever Ts is a proper ...

This report describes a strong connection between maximum satisfiability and minimally-unsatisfiable subfor-mulas of any constraint system, as well as techniques for exploiting it. Focusing on CNF formulas, we explore this relationship and present novel algorithms for extracting minimally-unsatisfiable subformulas, including one that finds all such subformulas. We present experimental results s...

Let φ be a w-continuous homomorphism from a dual Banach algebra to C. The notion of φ-Connes amenability is studied and some characterizations is given. A type of diagonal for dual Banach algebras is dened. It is proved that the existence of such a diagonal is equivalent to φ-Connes amenability. It is also shown that φ-Connes amenability is equivalent to so-called φ-splitting of a certain short...

Java’s memory-safety relies on the Java Virtual Machine checking that each access to an array does not exceed the bounds of that array. When static analysis can determine that some array access instruction will never use an out of bounds index, the cost of dynamically checking the index each time the instruction is executed can be avoided. This report introduces Block-Qualified Variable Elimina...

In 1979, Fischer and Ladner introduced Propositional Dynamic Logic (PDL) as a logical formalism for reasoning about programs [9]. Since then, PDL has become a classic of logic in computer science [11], and many extensions and variations have been proposed. Several of these extensions are inspired by the original application of reasoning about programs, while others aim at the numerous novel app...

computation. BDDs have been very successful in this Abstract respect. One of the main obstacles to automatic verification A global optimization is a transformation taking an of Finite State Systems (FSSs) is state explosion. In MC problem (M, φ) and returning an (hopefully) easier this respect automatic verification of an FSS M using MC problem (M', φ') s.t. answer(M, φ) = answer(M', φ'). Model...

We show how the nearly bi-maximal mixing scenario comes out naturally from gauged SO(3) F flavor symmetry via spontaneous symmetry breaking. An interesting relation between the neutrino mass-squared differences and the mixing angle, i.e., ∆m 2 µe /∆m 2 τ µ ≃ 2|U e3 | 2 is obtained. The smallness of the ratio (or |U e3 |) can also naturally be understood from an approximate permutation symmetry....

computation. BDDs have been very successful in this Abstract respect. One of the main obstacles to automatic verification A global optimization is a transformation taking an of Finite State Systems (FSSs) is state explosion. In MC problem (M, φ) and returning an (hopefully) easier this respect automatic verification of an FSS M using MC problem (M', φ') s.t. answer(M, φ) = answer(M', φ'). Model...