Automata for true concurrency properties

We present an automata-theoretic framework for the model checking of true concurrency properties. These are specified in a fixpoint logic, corresponding to history-preserving bisimilarity, capable of describing events in computations and their dependencies. The models of the logic are event structures or any formalism which can be given a causal semantics, like Petri nets. Given a formula and an event structure satisfying suitable regularity conditions we show how to construct a parity tree automaton whose language is non-empty if and only if the event structure satisfies the formula. The automaton, due to the nature of event structure models, is usually infinite. We discuss how it can be quotiented to an equivalent finite automaton, where emptiness can be checked effectively. In order to show the applicability of the approach, we discuss how it instantiates to finite safe Petri nets. As a proof of concept we provide a model checking tool implementing the technique

Interactive Semantic Alignment Model: Social Influence and Local Transmission Bottleneck

We provide a computational model of semantic alignment among communicating agents constrained by social and cognitive pressures. We use our model to analyze the effects of social stratification and a local transmission bottleneck on the coordination of meaning in isolated dyads. The analysis suggests that the traditional approach to learning-understood as inferring prescribed meaning from observations-can be viewed as a special case of semantic alignment, manifesting itself in the behaviour of socially imbalanced dyads put under mild pressure of a local transmission bottleneck. Other parametrizations of the model yield different long-term effects, including lack of convergence or convergence on simple meanings only

Quantum Optics and Solid State Spectroscopy

Possibility of formation of strongly correlated states of the bosonic excitations in solids similar to the squeezed states of photons is considered. The possibility of observation of these states in optical spectroscopy is discussed

Theoretical Computer Science: Computability, Decidability and Logic

International audienceThis chapter deals with a question in the very core of IA: what can be computed by a machine? An agreement has been reached on the answer brought by Alan Turing in 1936. Indeed, all other proposed approaches have led to exactly the same answer. Thus, there is a mathematical model of what can be done by a machine. And this has allowed to prove surprising results which feed the reflection on intelligence and machines

Coherent and Squeezed States: Introductory Review of Basic Notions, Properties, and Generalizations

A short review of the main properties of coherent and squeezed states is given in introductory form. The efforts are addressed to clarify concepts and notions, including some passages of the history of science, with the aim of facilitating the subject for nonspecialists. In this sense, the present work is intended to be complementary to other papers of the same nature and subject in current circulation.Comment: 50 pages, misprints corrected, some new references included. To appear in "Integrability, Supersymmetry and Coherent States. A Volume in Honor of Professor Veronique Hussin