Abstract
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem itself is formulated via M. Smyth's idea of treating observable properties as open sets of a topological space. The proof hinges on a 'topological generalisation' of Konig's lemma in the setting of probabilistic programming (a result that is proved in the paper as well). One application of the theorem is that it entails semi-decidability w.r.t. whether a concurrent program satisfies an observable property (written in a certain form). This is related to M. Escardo's conjecture about semi-decidability w.r.t. may and must probabilistic testing.

Abstract
The authors wish to make the following corrections to this manuscript [...]

Abstract

Abstract
This paper presents a novel approach to improve the conversion of interferometric synthetic aperture radar (InSAR) ascending and descending orbit measurements into horizontal and vertical deformation components, explicitly considering SAR product characteristics (acquisition geometry, resolution, and positional accuracy). Conventional decomposition methods use square grids, inadequately addressing directional biases associated with satellite images characteristics, reducing measurement accuracy. It is proposed optimized alternative geometries - rectangle, hexagon, and double inverted isosceles trapezoid (diIT) - derived from theoretical analysis of scatterer influence areas for Sentinel-1 imagery and calibrated data from the European ground motion service (EGMS). Validation was conducted comparing results against global navigation satellite system (GNSS) ground-truth data. Accuracy was quantitatively evaluated using deformation velocity (DV) and average Euclidean distance (ED) metrics. Results demonstrated an average 25% improvement in DV detection over traditional square grids, with only minor trade-offs, such as lower scatterer density and sub-millimetric increases in error for hexagon and diIT geometries.

Abstract

Abstract
The advent of 5th Generation (5G) networks has introduced the strategy of network slicing as a paradigm shift, enabling the provision of services with distinct Quality of Service (QoS) requirements. The 5th Generation New Radio (5G NR) standard complies with the use cases Enhanced Mobile Broadband (eMBB), Ultra-Reliable Low Latency Communications (URLLC), and Massive Machine Type Communications (mMTC), which demand a dynamic adaptation of network slicing to meet the diverse traffic needs. This dynamic adaptation presents both a critical challenge and a significant opportunity to improve 5G network efficiency. This paper proposes a Deep Reinforcement Learning (DRL) agent that performs dynamic resource allocation in 5G wireless network slicing according to traffic requirements of the 5G use cases within two scenarios: eMBB with URLLC and eMBB with mMTC. The DRL agent evaluates the performance of different decoding schemes such as Orthogonal Multiple Access (OMA), Non-Orthogonal Multiple Access (NOMA), and Rate Splitting Multiple Access (RSMA) and applies the best decoding scheme in these scenarios under different network conditions. The DRL agent has been tested to maximize the sum rate in scenario eMBB with URLLC and to maximize the number of successfully decoded devices in scenario eMBB with mMTC, both with different combinations of number of devices, power gains and number of allocated frequencies. The results show that the DRL agent dynamically chooses the best decoding scheme and presents an efficiency in maximizing the sum rate and the decoded devices between 84% and 100% for both scenarios evaluated.