Parametric Linear Dynamic Logic

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL) that is able to express all $\omega$-regular specifications while still maintaining many of LTL's desirable properties like an intuitive syntax and a translation into non-deterministic B\"uchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all $\omega$-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic B\"uchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.Comment: In Proceedings GandALF 2014, arXiv:1408.556

Neurophysiologie de l’hypnose

We here review behavioral, neuroimaging and electrophysiological studies of hypnosis as a state, as well as hypnosis as a tool to modulate brain responses to painful stimulations. Studies have shown that hypnotic processes modify internal (self awareness) as well as external (environmental awareness) brain networks. Brain mechanisms underlying the modulation of pain perception under hypnotic conditions involve cortical as well as subcortical areas including anterior cingulate and prefrontal cortices, basal ganglia and thalami. Combined with local anesthesia and conscious sedation in patients undergoing surgery, hypnosis is associated with improved peri- and postoperative comfort of patients and surgeons. Finally, hypnosis can be considered as a useful analogue for simulating conversion and dissociation symptoms in healthy subjects, permitting better characterization of these challenging disorders by producing clinically similar experiences

Parametric Linear Dynamic Logic

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by adding temporal operators equipped with parameters that bound their scope. LDL is an extension of Linear Temporal Logic (LTL) to all ω-regular specifications, while maintaining a translation into exponentially-sized non-deterministic Büchi automata. Since LDL cannot express timing constraints, we add parameterized operators and subsume parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our contribution is a translation of PLDL into exponentially-sized non-deterministic Büchi automata via alternating automata. This yields PSPACE algorithms for model checking and assume-guarantee model checking and a 2EXPTIME realizability algorithm. The problems are complete for their complexity classes. We give tight bounds on optimal parameter values for model checking and realizability and present a PSPACE procedure for model checking optimization and a 3EXPTIME algorithm for realizability optimization. Our results show that these PLDL problems are no harder than their (parametric) LTL counterparts

Temporal Stream Logic: Synthesis beyond the Bools

Reactive systems that operate in environments with complex data, such as mobile apps or embedded controllers with many sensors, are difficult to synthesize. Synthesis tools usually fail for such systems because the state space resulting from the discretization of the data is too large. We introduce TSL, a new temporal logic that separates control and data. We provide a CEGAR-based synthesis approach for the construction of implementations that are guaranteed to satisfy a TSL specification for all possible instantiations of the data processing functions. TSL provides an attractive trade-off for synthesis. On the one hand, synthesis from TSL, unlike synthesis from standard temporal logics, is undecidable in general. On the other hand, however, synthesis from TSL is scalable, because it is independent of the complexity of the handled data. Among other benchmarks, we have successfully synthesized a music player Android app and a controller for an autonomous vehicle in the Open Race Car Simulator (TORCS.

Differentiating muscle damage from myocardial injury by meaans of the serum creatinine kinase (CK) isoenzyme MB mass measurement/total CK activity ratio

We immunoenzymometrically measured creatine kinase (CK) isoenzyme MB in extracts of myocardium and in homogenates of five different skeletal muscles. CK-MB concentrations in the former averaged 80.9 micrograms/g wet tissue; in the skeletal muscles it varied widely, being (e.g.) 25-fold greater in diaphragm than in psoas. CK-MB in skeletal muscles ranged from 0.9 to 44 ng/U of total CK; the mean for myocardium was 202 ng/U. In sera from 10 trauma and 36 burn patients without myocardial involvement, maximum ratios for CK-MB mass/total CK activity averaged 7 (SEM 1) ng/U and 18 (SEM 6) ng/U, respectively. Except for an infant (220 ng/U), the highest ratio we found for serum after muscular damage was 38 ng/U. In contrast, the mean maximum ratio determined in 23 cases of acute myocardial infarction exceeded 200 ng/U. Among seven determinations performed 8 to 32 h after onset of symptoms, each infarct patient demonstrated at least one ratio greater than or equal to 110 ng/U. Ratios observed after infarct were unrelated to treatment received during the acute phase. We propose a CK-MB/total CK ratio of 80 ng/U as the cutoff value for differentiating myocardial necrosis from muscular injury

Psychological interventions influence patients' attitudes and beliefs about their chronic pain.

Background: Patients' changing attitudes and beliefs about pain are considered as improvements in the treatment of chronic pain. Multidisciplinary approaches to pain allow modifications of coping strategies of patients, from passive to active. Methods: We investigate how two therapeutic treatments impact patients' attitudes and beliefs regarding pain, as measured with the Survey of Pain Attitudes (SOPA). We allocated 415 patients with chronic pain either to psychoeducation combined with physiotherapy, self-hypnosis combined with self-care learning, or to control groups. Pain intensity, global impression of change, and beliefs and attitudes regarding pain were assessed before and after treatment. Results: Our main results showed a significant effect of psychoeducation/physiotherapy on control, harm, and medical cure SOPA subscales; and a significant effect of self-hypnosis/self-care on control, disability and medical cure subscales. Correlation results showed that pain perception was negatively associated with control, while positively associated with disability, and a belief that hurt signifies harm. Patients' impression of improvement was associated with greater control, lower disability, and lower belief that hurt signifies harm. Conclusions: The present study showed that self-hypnosis/self-care and psychoeducation/physiotherapy were associated with patients' evolution of coping strategies from passive to active, allowing them to reduce pain perception and improve their global impression of treatment effectiveness. Keywords: Chronic pain, Hypnosis, Psychoeducation, Coping, Pain belief

QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property

The QRAT (quantified resolution asymmetric tautology) proof system simulates virtually all inference rules applied in state of the art quantified Boolean formula (QBF) reasoning tools. It consists of rules to rewrite a QBF by adding and deleting clauses and universal literals that have a certain redundancy property. To check for this redundancy property in QRAT, propositional unit propagation (UP) is applied to the quantifier free, i.e., propositional part of the QBF. We generalize the redundancy property in the QRAT system by QBF specific UP (QUP). QUP extends UP by the universal reduction operation to eliminate universal literals from clauses. We apply QUP to an abstraction of the QBF where certain universal quantifiers are converted into existential ones. This way, we obtain a generalization of QRAT we call QRAT+. The redundancy property in QRAT+ based on QUP is more powerful than the one in QRAT based on UP. We report on proof theoretical improvements and experimental results to illustrate the benefits of QRAT+ for QBF preprocessing.Comment: preprint of a paper to be published at IJCAR 2018, LNCS, Springer, including appendi

Labour Market and Social Policy in Italy: Challenges and Changes. Bertelsmann Policy Brief #2016/02

vEight years after the outbreak of the financial crisis, Italy has still to cope with and overcome a plethora of economic and social challenges. On top of this, it faces an unfavourable demographic structure and severe disparities between its northern and southern regions. Some promising reforms have recently been enacted, specifically targeting poverty and social exclusion. However, much more remains to be done on the way towards greater economic stability and widely shared prosperity