1,090 research outputs found
C-type lectins and their role in the immune system: New insights into the characteristics of DCIR and DC-SIGN
Kooyk, Y. van [Promotor]Garssen, J. [Promotor]Vliet, S.J. van [Copromotor]Garcia Vallejo, J.J. [Copromotor
Limb amputations in fixed dystonia: a form of body integrity identity disorder?
Fixed dystonia is a disabling disorder mainly affecting young women who develop fixed abnormal limb postures and pain after apparently minor peripheral injury. There is continued debate regarding its pathophysiology and management. We report 5 cases of fixed dystonia in patients who sought amputation of the affected limb. We place these cases in the context of previous reports of patients with healthy limbs and patients with chronic regional pain syndrome who have sought amputation. Our cases, combined with recent data regarding disorders of mental rotation in patients with fixed dystonia, as well as previous data regarding body integrity identity disorder and amputations sought by patients with chronic regional pain syndrome, raise the possibility that patients with fixed dystonia might have a deficit in body schema that predisposes them to developing fixed dystonia and drives some to seek amputation. The outcome of amputation in fixed dystonia is invariably unfavorable
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
The classic approaches to synthesize a reactive system from a linear temporal
logic (LTL) specification first translate the given LTL formula to an
equivalent omega-automaton and then compute a winning strategy for the
corresponding omega-regular game. To this end, the obtained omega-automata have
to be (pseudo)-determinized where typically a variant of Safra's
determinization procedure is used. In this paper, we show that this
determinization step can be significantly improved for tool implementations by
replacing Safra's determinization by simpler determinization procedures. In
particular, we exploit (1) the temporal logic hierarchy that corresponds to the
well-known automata hierarchy consisting of safety, liveness, Buechi, and
co-Buechi automata as well as their boolean closures, (2) the non-confluence
property of omega-automata that result from certain translations of LTL
formulas, and (3) symbolic implementations of determinization procedures for
the Rabin-Scott and the Miyano-Hayashi breakpoint construction. In particular,
we present convincing experimental results that demonstrate the practical
applicability of our new synthesis procedure
Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis
Abstract. We consider the problem of compositional refinement of com-ponents ’ specifications in the context of compositional reactive synthe-sis. Our solution is based on automatic refinement of assumptions and guarantees expressed in linear temporal logic (LTL). We show how be-haviors of the environment and the system can be inferred from counter-strategies and strategies, respectively, as formulas in special forms called patterns. Instantiations of patterns are LTL formulas which hold over all runs of such strategies, and are used to refine the specification by adding new input assumptions or output guarantees. We propose three different approaches for compositional refinement of specifications, based on how much information is shared between the components, and demonstrate and compare the methods empirically.
LNCS
We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives
Near-Optimal Scheduling for LTL with Future Discounting
We study the search problem for optimal schedulers for the linear temporal
logic (LTL) with future discounting. The logic, introduced by Almagor, Boker
and Kupferman, is a quantitative variant of LTL in which an event in the far
future has only discounted contribution to a truth value (that is a real number
in the unit interval [0, 1]). The precise problem we study---it naturally
arises e.g. in search for a scheduler that recovers from an internal error
state as soon as possible---is the following: given a Kripke frame, a formula
and a number in [0, 1] called a margin, find a path of the Kripke frame that is
optimal with respect to the formula up to the prescribed margin (a truly
optimal path may not exist). We present an algorithm for the problem; it works
even in the extended setting with propositional quality operators, a setting
where (threshold) model-checking is known to be undecidable
Multiplayer Cost Games with Simple Nash Equilibria
Multiplayer games with selfish agents naturally occur in the design of
distributed and embedded systems. As the goals of selfish agents are usually
neither equivalent nor antagonistic to each other, such games are non zero-sum
games. We study such games and show that a large class of these games,
including games where the individual objectives are mean- or discounted-payoff,
or quantitative reachability, and show that they do not only have a solution,
but a simple solution. We establish the existence of Nash equilibria that are
composed of k memoryless strategies for each agent in a setting with k agents,
one main and k-1 minor strategies. The main strategy describes what happens
when all agents comply, whereas the minor strategies ensure that all other
agents immediately start to co-operate against the agent who first deviates
from the plan. This simplicity is important, as rational agents are an
idealisation. Realistically, agents have to decide on their moves with very
limited resources, and complicated strategies that require exponential--or even
non-elementary--implementations cannot realistically be implemented. The
existence of simple strategies that we prove in this paper therefore holds a
promise of implementability.Comment: 23 page
- …