Related papers: On the Axiomatisability of Parallel Composition
We study the problem of jointly designing a sparse sensor and actuator schedule for linear dynamical systems while guaranteeing a control/estimation performance that approximates the fully sensed/actuated setting. We further prove a…
We first present a probabilistic version of ACP that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved and then extend this…
We derive new bounds on achievable precision in the most general adaptive quantum metrological scenarios. The bounds are proven to be asymptotically saturable and equivalent to the known parallel scheme bounds in the limit of large number…
The aim of this note is to present a self-contained proof of the fact that a function can be approximated using a linear combination of Gaussian coherent states, with a number of terms controlled in terms of the smoothness and of the decay…
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…
Continuing the study initiated in our earlier article [7], this paper aims to characterize various continuity properties of nonlinear composition operators acting on some sequence spaces, giving special attention to the space of sequences…
The fixed template Promise Constraint Satisfaction Problem (PCSP) is a recently proposed significant generalization of the fixed template CSP, which includes approximation variants of satisfiability and graph coloring problems. All the…
In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…
We introduce three general compositionality criteria over operational semantics and prove that, when all three are satisfied together, they guarantee weak bisimulation being a congruence. Our work is founded upon Turi and Plotkin's…
In this paper, a Gaifman-Shapiro-style module architecture is tailored to the case of Smodels programs under the stable model semantics. The composition of Smodels program modules is suitably limited by module conditions which ensure the…
Scenarios of execution are commonly used to specify partial behaviour and interactions between different objects and components in a system. To avoid overall inconsistency in specifications, various automated methods have emerged in the…
Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…
In this paper, we consider the simultaneously symmetrization and spectral finiteness for a finite set of real 2-by-2 matrices.
One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition…
The problem of scheduling conflicting jobs on parallel machines consists in assigning a set of jobs to a set of machines so that no two conflicting jobs are allocated to the same machine, and the maximum processing time among all machines…
Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…
We investigate the asymptotic symmetries of asymptotically flat spacetimes at spatial infinity. We propose a new symplectic structure and conservative boundary conditions in a polyhomogeneous Beig-Schmidt expansion. The asymptotic…
In this paper, we produce a cellular motivic spectrum of motivic modular forms over $\R$ and $\C$, answering positively to a conjecture of Dan Isaksen. This spectrum is constructed to have the appropriate cohomology, as a module over the…
SMT-based program analysis and verification often involve reasoning about program features that have been specified using quantifiers; incorporating quantifiers into SMT-based reasoning is, however, known to be challenging. If quantifier…
Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…