Related papers: On the Complexity of Techniques That Make Transiti…
Recent developments in Omics-technologies revolutionized the investigation of biology by producing molecular data in multiple dimensions and scale. This breakthrough in biology raises the crucial issue of their interpretation based on…
This letter is a proof of concept for an improved transmission switching (TS) performance by moving the search space to load shed buses. Research from the past shows that changing transmission system topology changes the power flows and…
A Boolean network (BN) is a discrete dynamical system defined by a Boolean function that maps to the domain itself. A trap space of a BN is a generalization of a fixed point, which is defined as the sub-hypercubes closed by the function of…
Labelled Transition Systems (LTSs) are a fundamental semantic model in many areas of informatics, especially concurrency theory. Yet, reasoning on LTSs and relations between their states can be difficult and elusive: very simple process…
Topological phase transition is accompanied with a change of topological numbers. It has been believed that the gap closing and the breakdown of the adiabaticity at the transition point is necessary in general. However, the gap closing is…
Transition-based parsers implemented with Pointer Networks have become the new state of the art in dependency parsing, excelling in producing labelled syntactic trees and outperforming graph-based models in this task. In order to further…
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…
Automated synthesis from behavioural specifications is an attractive and powerful way of constructing concurrent systems. Here we focus on the problem of synthesising a membrane system from a behavioural specification given in the form of a…
In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown…
Time delays pose an important challenge in networked control systems, which are now ubiquitous. Focusing on switched systems, we introduce a framework that provides an upper bound for errors caused by switching delays. Our framework is…
We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we…
The study of critical phenomena and phase transitions is an important part of modern condensed matter physics. In this regard, the phenomenological Landau theory has been extraordinarily useful. Hereby we present an alternative theoretical…
In this paper, we focus on the study of quotients of Boolean control networks (BCNs) with the motivation that they might serve as smaller models that still carry enough information about the original network. Given a BCN and an equivalence…
In this paper, we study the pooled data problem of identifying the labels associated with a large collection of items, based on a sequence of pooled tests revealing the counts of each label within the pool. In the noiseless setting, we…
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…
A Boolean network (BN) is a transformation of the set of Boolean configurations of a given length. A trapspace of a BN is a subcube invariant by the BN; a principal trapspace is the smallest trapspace containing a given configuration; a…
Topological order in a 2d quantum matter can be determined by the topological contribution to the entanglement R\'enyi entropies. However, when close to a quantum phase transition, its calculation becomes cumbersome. Here we show how…
In this paper we study flow problems on temporal networks, where edge capacities and travel times change over time. We consider a network with $n$ nodes and $m$ edges where the capacity and length of each edge is a piecewise constant…
Boolean networks may be viewed as idealizations of biological genetic networks, where each node is represented by an on-off switch which is a function of the binary output from some other nodes. We evolve connectivity in a single Boolean…
Computer networks are hard to manage. Given a set of high-level requirements (e.g., reachability, security), operators have to manually figure out the individual configuration of potentially hundreds of devices running complex distributed…