849 research outputs found
Limit Synchronization in Markov Decision Processes
Markov decision processes (MDP) are finite-state systems with both strategic
and probabilistic choices. After fixing a strategy, an MDP produces a sequence
of probability distributions over states. The sequence is eventually
synchronizing if the probability mass accumulates in a single state, possibly
in the limit. Precisely, for 0 <= p <= 1 the sequence is p-synchronizing if a
probability distribution in the sequence assigns probability at least p to some
state, and we distinguish three synchronization modes: (i) sure winning if
there exists a strategy that produces a 1-synchronizing sequence; (ii)
almost-sure winning if there exists a strategy that produces a sequence that
is, for all epsilon > 0, a (1-epsilon)-synchronizing sequence; (iii) limit-sure
winning if for all epsilon > 0, there exists a strategy that produces a
(1-epsilon)-synchronizing sequence.
We consider the problem of deciding whether an MDP is sure, almost-sure,
limit-sure winning, and we establish the decidability and optimal complexity
for all modes, as well as the memory requirements for winning strategies. Our
main contributions are as follows: (a) for each winning modes we present
characterizations that give a PSPACE complexity for the decision problems, and
we establish matching PSPACE lower bounds; (b) we show that for sure winning
strategies, exponential memory is sufficient and may be necessary, and that in
general infinite memory is necessary for almost-sure winning, and unbounded
memory is necessary for limit-sure winning; (c) along with our results, we
establish new complexity results for alternating finite automata over a
one-letter alphabet
Real-Time Synthesis is Hard!
We study the reactive synthesis problem (RS) for specifications given in
Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very
general setting, but on infinite words only; and only the very restrictive BRRS
subcase is known to be decidable (see D'Souza et al. and Bouyer et al.). In
this paper, we precise the decidability border of MITL synthesis. We show RS is
undecidable on finite words too, and present a landscape of restrictions (both
on the logic and on the possible controllers) that are still undecidable. On
the positive side, we revisit BRRS and introduce an efficient on-the-fly
algorithm to solve it
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with
clocks where the objectives of players are described using parity conditions.
The games are \emph{concurrent} in that at each turn, both players
independently propose a time delay and an action, and the action with the
shorter delay is chosen. To prevent a player from winning by blocking time, we
restrict each player to play strategies that ensure that the player cannot be
responsible for causing a zeno run. First, we present an efficient reduction of
these games to \emph{turn-based} (i.e., not concurrent) \emph{finite-state}
(i.e., untimed) parity games. Our reduction improves the best known complexity
for solving timed parity games. Moreover, the rich class of algorithms for
classical parity games can now be applied to timed parity games. The states of
the resulting game are based on clock regions of the original game, and the
state space of the finite game is linear in the size of the region graph.
Second, we consider two restricted classes of strategies for the player that
represents the controller in a real-time synthesis problem, namely,
\emph{limit-robust} and \emph{bounded-robust} winning strategies. Using a
limit-robust winning strategy, the controller cannot choose an exact
real-valued time delay but must allow for some nonzero jitter in each of its
actions. If there is a given lower bound on the jitter, then the strategy is
bounded-robust winning. We show that exact strategies are more powerful than
limit-robust strategies, which are more powerful than bounded-robust winning
strategies for any bound. For both kinds of robust strategies, we present
efficient reductions to standard timed automaton games. These reductions
provide algorithms for the synthesis of robust real-time controllers
Using Strategy Improvement to Stay Alive
We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides
solving an MPG in the usual sense, our algorithm computes more information
about the game, information that is important with respect to applications. The
weights of the edges of an MPG can be thought of as a gained/consumed energy --
depending on the sign. For each vertex, our algorithm computes the minimum
amount of initial energy that is sufficient for player Max to ensure that in a
play starting from the vertex, the energy level never goes below zero. Our
algorithm is not the first algorithm that computes the minimum sufficient
initial energies, but according to our experimental study it is the fastest
algorithm that computes them. The reason is that it utilizes the strategy
improvement technique which is very efficient in practice
Plasmonic Metasurface for Directional and Frequency-Selective Thermal Emission
International audienceIncandescent filaments and membranes are often used as infrared sources despite their low efficiency, broad angular emission, and lack of spectral selectivity. Here, we introduce a metasurface to control simultaneously the spectrum and the directivity of blackbody radiation. The plasmonic metasurface operates reliably at 600 °C with an emissivity higher than 0.85 in a narrow frequency band and in a narrow solid angle. This emitter paves the way for the development of compact, efficient, and cheap IR sources and gas detection systems
An Axiomatic Approach to Liveness for Differential Equations
This paper presents an approach for deductive liveness verification for
ordinary differential equations (ODEs) with differential dynamic logic.
Numerous subtleties complicate the generalization of well-known discrete
liveness verification techniques, such as loop variants, to the continuous
setting. For example, ODE solutions may blow up in finite time or their
progress towards the goal may converge to zero. Our approach handles these
subtleties by successively refining ODE liveness properties using ODE
invariance properties which have a well-understood deductive proof theory. This
approach is widely applicable: we survey several liveness arguments in the
literature and derive them all as special instances of our axiomatic refinement
approach. We also correct several soundness errors in the surveyed arguments,
which further highlights the subtlety of ODE liveness reasoning and the utility
of our deductive approach. The library of common refinement steps identified
through our approach enables both the sound development and justification of
new ODE liveness proof rules from our axioms.Comment: FM 2019: 23rd International Symposium on Formal Methods, Porto,
Portugal, October 9-11, 201
Distribution-based bisimulation for labelled Markov processes
In this paper we propose a (sub)distribution-based bisimulation for labelled
Markov processes and compare it with earlier definitions of state and event
bisimulation, which both only compare states. In contrast to those state-based
bisimulations, our distribution bisimulation is weaker, but corresponds more
closely to linear properties. We construct a logic and a metric to describe our
distribution bisimulation and discuss linearity, continuity and compositional
properties.Comment: Accepted by FORMATS 201
Emergence of four dimensional quantum mechanics from a deterministic theory in 11 dimensions
We develop a deterministic theory which accounts for the coupling of a high dimensional continuum of environmental excitations (called gravonons) to massive particle in a very localized and very weak fashion. For the model presented Schrodinger's equation can be solved practically exactly in 11 spacetime dimensions and the result demonstrates that as a function of time an incoming matter wave incident on a screen extinguishes, except at a single interaction center on the detection screen. This transition is reminiscent of the wave - particle duality arising from the "collapse" (also called "process one") postulated in the Copenhagen-von Neumann interpretation. In our theory it is replaced by a sticking process of the particle from the vacuum to the surface of the detection screen. This situation was verified in experiments by using massive molecules. In our theory this "wave-particle transition" is connected to the different dimensionalities of the space for particle motion and the gravonon dynamics, the latter propagating in the hidden dimensions of 11 dimensional spacetime. The fact that the particle is detected at apparently statistically determined points on the screen is traced back to the weakness and locality of the interaction with the gravonons which allows coupling on the energy shell alone. Although the theory exhibits a completely deterministic "chooser" mechanism for single site sticking, an apparent statistical character results, as it is found in the experiments, due to small heterogeneities in the atomic and gravonon structures
Effects of proton versus photon irradiation on (lymph) angiogenic, inflammatory, proliferative and anti-tumor immune responses in head and neck squamous cell carcinoma
International audienceThe proximity of organs at risk makes the treatment of head and neck squamous cell carcinoma (HNSCC) challenging by standard radiotherapy. The higher precision in tumor targeting of proton (P) therapy could promote it as the treatment of choice for HNSCC. Besides the physical advantage in dose deposition, few is known about the biological impact of P versus photons (X) in this setting. To investigate the comparative biological effects of P versus X radiation in HNSCC cells, we assessed the relative biological effectiveness (RBE), viability, proliferation and mRNA levels for genes involved in (lymph)angiogenesis, inflammation, proliferation and anti-tumor immunity. These parameters, particularly VEGF-C protein levels and regulations, were documented in freshly irradiated and/or long-term surviving cells receiving low/high-dose, single (SI)/multiple (MI) irradiations with P/X. The RBE was found to be 1.1 Key (lymph)angiogenesis and inflammation genes were downregulated (except for vegf-c) after P and upregulated after X irradiation in MI surviving cells, demonstrating a more favorable profile after P irradiation. Both irradiation types stimulated vegf-c promoter activity in a NF-ÎşB-dependent transcriptional regulation manner, but at a lesser extent after P, as compared to X irradiation, which correlated with mRNA and protein levels. The cells surviving to MI by P or X generated tumors with higher volume, anarchic architecture and increased density of blood vessels. Increased lymphangiogenesis and a transcriptomic analysis in favor of a more aggressive phenotype were observed in tumors generated with X-irradiated cells. Increased detection of lymphatic vessels in relapsed tumors from patients receiving X radiotherapy was consistent with these findings. This study provides new data about the biological advantage of P, as compared to X irradiation. In addition to its physical advantage in dose deposition, P irradiation may help to improve treatment approaches for HNSCC
- …