Impatience for Weakly Paretian Orders: Existence and Genericity

We study order theoretic and topological implications for impatience of weakly Paretian, representable orders on infinite utility streams. As a departure from the traditional literature, we do not make any continuity assumptions in proving the existence of impatient points. Impatience is robust in the sense that there are uncountably many impatient points. A general statement about genericity of impatience cannot be made for representable, weakly Paretian orders. This is shown by means of an example. If we assume a stronger sensitivity condition, then genericity obtains.Impatience Condition, Weak Pareto, Sensitivity Conditions, Genericity, Order Types, Uncountable Sets

Abstraction in directed model checking

Abstraction is one of the most important issues to cope with large and infinite state spaces in model checking and to reduce the verification efforts. The abstract system is smaller than the original one and if the abstract system satisfies a correctness specification, so does the concrete one. However, abstractions may introduce a behavior violating the specification that is not present in the original system. This paper bypasses this problem by proposing the combination of abstraction with heuristic search to improve error detection. The abstract system is explored in order to create a database that stores the exact distances from abstract states to the set of abstract error states. To check, whether or not the abstract behavior is present in the original system, effcient exploration algorithms exploit the database as a guidance