A variant of the classical knapsack problem is considered in which each item associated with an integer weight and a qualitative level. We define dominance relation over feasible subsets given set show that this defines preorder. propose dynamic programming algorithm to compute entire non-dominated rank cardinality vectors we state two greedy algorithms, efficiently single efficient solution.

Abstract We run an experiment to elicit preferences over state-contingent timed payouts. analyze the data using a new revealed preference method (building on Nishimura, Ok, and Quah (2017)) that can test for consistency with utility functions increase given preorder. find correlation neutrality, property implied by discounted expected utility, is widely violated there is, instead, strong eviden...

We present an approach to understanding first-order theories by exploring their models. A typical use case is the analysis of artifacts such as policies, protocols, configurations, and software designs. For the analyses we offer, users are not required to frame formal properties or construct derivations. Rather, they can explore examples of their designs, confirming the expected instances and p...

The paper proposes a variation of simulation for checking and proving contextual equivalence in a non-deterministic call-by-need lambda-calculus with constructors, case, seq, and a letrec with cyclic dependencies. It also proposes a novel method to prove its correctness. The calculus’ semantics is based on a small-step rewrite semantics and on may-convergence. The cyclic nature of letrec bindin...

This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two concurrent systems are said to be in conflict if they can get trapped in a situation where they are waiting or running endlessly, forever unable to complete their common task. ...

A notion of central importance in categorical topology is that of topological functor. A faithful functor E → B is called topological if it admits cartesian liftings of all (possibly large) families of arrows; the basic example is the forgetful functor Top→ Set. A topological functor E → 1 is the same thing as a (large) complete preorder, and the general topological functor E → B is intuitively...

In the context of asynchronously communicating and deadlock free services, the refinement relation of services has been formalized by the accordance preorder. A service Impl accords with a service Spec if every controller of Spec—that is, every environment that can interact with service Spec without deadlocking—is a controller of Impl . The procedure to decide accordance of two services uses th...

Given (1) an architecture defined by processes and communication channels between them or with the environment, and (2) a specification on the messages transmitted over the channels, distributed synthesis aims at deciding existence of local programs, one for each process, that together meet the specification, whatever the environment does. Recent work shows that this problem can be solved when ...

This work shows how any classiication system based on orders may be extended to pre-orders. Such systems build hierarchies of object representations with a strict ordering relation between them and do not provide for the retention of multiple logically equivalent representations. In some domains retention of equivalent representations is required-this arises for example when integrating knowled...

We introduce a notion of real-valued reward testing for probabilistic processes by extending the traditional nonnegative-reward testing with negative rewards. In this richer testing framework, the may and must preorders turn out to be inverses. We show that for convergent processes with finitely many states and transitions, but not in the presence of divergence, the real-reward must-testing pre...