Non-blocking supervisory control for initialised rectangular automata

We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised. The supervisory controller is state feedback and disables discrete-event transitions in order to solve the non-blocking forbidden state problem. The non-blocking problem is defined under both strong and weak conditions. For the latter maximally permissive solutions that are computable on a finite quotient space characterised by language equivalence are derived

Complex-Dynamical Extension of the Fractal Paradigm and Its Applications in Life Sciences

Complex-dynamical fractal is a hierarchy of permanently, chaotically changing versions of system structure, obtained as the unreduced, causally probabilistic general solution of arbitrary interaction problem (physics/0305119, physics/9806002). Intrinsic creativity of this extension of usual fractality determines its exponentially high operation efficiency, which underlies many specific functions of living systems, such as autonomous adaptability, "purposeful" development, intelligence and consciousness (at higher complexity levels). We outline in more detail genetic applications of complex-dynamic fractality, demonstrate the dominating role of genome interactions, and show that further progressive development of genetic research, as well as other life-science applications, should be based on the dynamically fractal structure analysis of interaction processes involved. The obtained complex-dynamical fractal of a living organism specifies the intrinsic unification of its interaction dynamics at all levels, from genome structure to higher brain functions. We finally summarise the obtained extension of mathematical concepts and approaches closely related to their biological applications

On the Polytope Escape Problem for Continuous Linear Dynamical Systems

The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function $f: \mathbb{R}^{d} \rightarrow \mathbb{R}^{d}$ and a convex polyhedron $\mathcal{P} \subseteq \mathbb{R}^{d}$, whether, for some initial point $\boldsymbol{x}_{0}$ in $\mathcal{P}$, the trajectory of the unique solution to the differential equation $\dot{\boldsymbol{x}}(t)=f(\boldsymbol{x}(t))$, $\boldsymbol{x}(0)=\boldsymbol{x}_{0}$, is entirely contained in $\mathcal{P}$. We show that this problem is decidable, by reducing it in polynomial time to the decision version of linear programming with real algebraic coefficients, thus placing it in $\exists \mathbb{R}$, which lies between NP and PSPACE. Our algorithm makes use of spectral techniques and relies among others on tools from Diophantine approximation.Comment: Accepted to HSCC 201

Unreduced Dynamic Complexity: Towards the Unified Science of Intelligent Communication Networks and Software

Operation of autonomic communication networks with complicated user-oriented functions should be described as unreduced many-body interaction process. The latter gives rise to complex-dynamic behaviour including fractally structured hierarchy of chaotically changing realisations. We recall the main results of the universal science of complexity (http://cogprints.org/4471/) based on the unreduced interaction problem solution and its application to various real systems, from nanobiosystems (http://cogprints.org/4527/) and quantum devices to intelligent networks (http://cogprints.org/4114/) and emerging consciousness (http://cogprints.org/3857/). We concentrate then on applications to autonomic communication leading to fundamentally substantiated, exact science of intelligent communication and software. It aims at unification of the whole diversity of complex information system behaviour, similar to the conventional, "Newtonian" science order for sequential, regular models of system dynamics. Basic principles and first applications of the unified science of complex-dynamic communication networks and software are outlined to demonstrate its advantages and emerging practical perspectives

Quantum gates on hybrid qudits

We introduce quantum hybrid gates that act on qudits of different dimensions. In particular, we develop two representative two-qudit hybrid gates (SUM and SWAP) and many-qudit hybrid Toffoli and Fredkin gates. We apply the hybrid SUM gate to generating entanglement, and find that operator entanglement of the SUM gate is equal to the entanglement generated by it for certain initial states. We also show that the hybrid SUM gate acts as an automorphism on the Pauli group for two qudits of different dimension under certain conditions. Finally, we describe a physical realization of these hybrid gates for spin systems.Comment: 8 pages and 1 figur

Reachability problems for systems with linear dynamics

This thesis deals with reachability and freeness problems for systems with linear dynamics, including hybrid systems and matrix semigroups. Hybrid systems are a type of dynamical system that exhibit both continuous and discrete dynamic behaviour. Thus they are particularly useful in modelling practical real world systems which can both flow (continuous behaviour) and jump (discrete behaviour). Decision questions for matrix semigroups have attracted a great deal of attention in both the Mathematics and Theoretical Computer Science communities. They can also be used to model applications with only discrete components. For a computational model, the reachability problem asks whether we can reach a target point starting from an initial point, which is a natural question both in theoretical study and for real-world applications. By studying this problem and its variations, we shall prove in a formal mathematical sense that many problems are intractable or even unsolvable. Thus we know when such a problem appears in other areas like Biology, Physics or Chemistry, either the problem itself needs to be simplified, or it should by studied by approximation. In this thesis we concentrate on a specific hybrid system model, called an HPCD, and its variations. The objective of studying this model is twofold: to obtain the most expressive system for which reachability is algorithmically solvable and to explore the simplest system for which it is impossible to solve. For the solvable sub-cases, we shall also study whether reachability is in some sense easy or hard by determining which complexity classes the problem belongs to, such as P, NP(-hard) and PSPACE(-hard). Some undecidable results for matrix semigroups are also shown, which both strengthen our knowledge of the structure of matrix semigroups, and lead to some undecidability results for other models

Continuity and computability of reachable sets

The computation of reachable sets of nonlinear dynamic and control systems is an important problem of systems theory. In this paper we consider the computability of reachable sets using Turing machines to perform approximate computations. We use Weihrauch's type-two theory of effectivity for computable analysis and topology, which provides a natural setting for performing computations on sets and maps. The main result is that the reachable set is lower-computable, but is only outer-computable if it equals the chain-reachable set. In the course of the analysis, we extend the computable topology theory to locally-compact Hausdorff spaces and semicontinuous set-valued maps, and provide a framework for computing approximations