Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting

We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term rewriting systems, which is obtained by extending the classic saturation-based approach. This result subsumes and unifies similar analyses on collapsible and ordered pushdown systems. Despite the rich literature on inverse preservation of recognizability for term rewrite systems, our result does not seem to follow from any previous study.Comment: in Proc. of FRE

Compelled to control: conflicting visions of the future of cyberspace

This report looks at the desire among states for greater control over the digital domain. It considers the convergence of controlling desires among the major cyberpowers and examines some of the main dynamics of the Russian and Chinese positions. Their positions are examined relative to each other and to the Western consensus. The paper analyses the potential implications for the global internet and the impact that developing countries may have on the dialogue

Timed pushdown automata revisited

This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of first-order definable PDA, a specialization of PDA in sets with atoms, as the right setting to define and investigate timed extensions of PDA. The general model obtained in this way is Turing complete. As our second result we prove NEXPTIME upper complexity bound for the non-emptiness problem for an expressive subclass. As a byproduct, we obtain a tight EXPTIME complexity bound for a more restrictive subclass of PDA with timeless stack, thus subsuming the complexity bound known for dense-timed PDA.Comment: full technical report of LICS'15 pape

Reachability analysis of first-order definable pushdown systems

We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed with the well-known saturation technique for the wide class of oligomorphic structures. Moreover, for the more restrictive homogeneous structures, we are able to give concrete complexity upper bounds. We show ample applicability of our technique by presenting several concrete examples of homogeneous structures, subsuming, with optimal complexity, known results from the literature. We show that infinitely many such examples of homogeneous structures can be obtained with the classical wreath product construction.Comment: to appear in CSL'1

Necessary and sufficient conditions for macroscopic realism from quantum mechanics

Macroscopic realism, the classical world view that macroscopic objects exist independently of and are not influenced by measurements, is usually tested using Leggett-Garg inequalities. Recently, another necessary condition called no-signaling in time (NSIT) has been proposed as a witness for non-classical behavior. In this paper, we show that a combination of NSIT conditions is not only necessary but also sufficient for a macrorealistic description of a physical system. Any violation of macroscopic realism must therefore be witnessed by a suitable NSIT condition. Subsequently, we derive an operational formulation for NSIT in terms of positive operator-valued measurements and the system Hamiltonian. We argue that this leads to a suitable definition of "classical" measurements and Hamiltonians, and apply our formalism to some generic coarse-grained quantum measurements.Comment: 10 pages, published versio

Spectrum of the Laplace-Beltrami Operator and the Phase Structure of Causal Dynamical Triangulation

We propose a new method to characterize the different phases observed in the non-perturbative numerical approach to quantum gravity known as Causal Dynamical Triangulation. The method is based on the analysis of the eigenvalues and the eigenvectors of the Laplace-Beltrami operator computed on the triangulations: it generalizes previous works based on the analysis of diffusive processes and proves capable of providing more detailed information on the geometric properties of the triangulations. In particular, we apply the method to the analysis of spatial slices, showing that the different phases can be characterized by a new order parameter related to the presence or absence of a gap in the spectrum of the Laplace-Beltrami operator, and deriving an effective dimensionality of the slices at the different scales. We also propose quantities derived from the spectrum that could be used to monitor the running to the continuum limit around a suitable critical point in the phase diagram, if any is found.Comment: 21 pages, 26 figures, 2 table

Klein's programme and Quantum Mechanics

We review the geometrical formulation of Quantum Mechanics to identify, according to Klein's programme, the corresponding group of transformations. For closed systems, it is the unitary group. For open quantum systems, the semigroup of Kraus maps contains, as a maximal subgroup, the general linear group. The same group emerges as the exponentiation of the $C^{*}$--algebra associated with the quantum system, when thought of as a Lie algebra. Thus, open quantum systems seem to identify the general linear group as associated with quantum mechanics and moreover suggest to extend the Klein programme also to groupoids. The usual unitary group emerges as a maximal compact subgroup of the general linear group.Comment: Amsart class, 24 pages, 4 figure