Related papers: Structural Liveness of Immediate Observation Petri…
One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder…
In this paper, we investigate the downlink transmission of a multiuser multiple-input single-output (MISO) channel under a symbol-level precoding (SLP) scheme, having imperfect channel knowledge at the transmitter. In defining the SLP…
In this paper, we explore the consequences of a distinction between `live' and `dead' network nodes; `live' nodes are able to acquire new links whereas `dead' nodes are static. We develop an analytically soluble growing network model…
We present a Rice-like complexity lower bound for any MSO-definable problem on binary structures succinctly encoded by circuits. This work extends the framework recently developed as a counterpoint to Courcelle's theorem for graphs encoded…
Over the past decade, structured illumination microscopy (SIM) has found its niche in super-resolution (SR) microscopy due to its fast imaging speed and low excitation intensity. However, due to the significantly higher light dose compared…
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no…
In this paper, we investigate an important research problem facing the upcoming satellite Internet: from a network perspective, how many satellites exactly do we need to construct a survivable and performant LSN? To answer this question, we…
The latent position model (LPM) is a popular method used in network data analysis where nodes are assumed to be positioned in a $p$-dimensional latent space. The latent shrinkage position model (LSPM) is an extension of the LPM which…
Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary…
Answering realistic questions about biological systems and pathways similar to the ones used by text books to test understanding of students about biological systems is one of our long term research goals. Often these questions require…
We investigate the problem of construction of small-size universal Petri nets with inhibitor arcs. We consider four descriptional complexity parameters: the number of places, transitions, inhibitor arcs, and the maximal degree of a…
Recent studies show that in interdependent networks a very small failure in one network may lead to catastrophic consequences. Above a critical fraction of interdependent nodes, even a single node failure can invoke cascading failures that…
Boolean nets are Petri nets that permit at most one token per place. Research has approached this important subject in many ways which resulted in various different classes of boolean nets. But yet, they are only distinguished by the…
In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate…
Although decidable, the marking reachability problem for Petri nets is well-known to be intractable in general, and a non-elementary lower bound has been recently uncovered. In order to alleviate this difficulty, various structural and…
Biological Petri Nets (Bio-PNs) require extensions beyond classical formalism to capture biochemical reality: multiple reactions simultaneously affect shared metabolites through convergent production or regulatory coupling, while signal…
Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…
We study the Student Project Allocation problem with lecturer preferences over Students (SPA-S), which involves the assignment of students to projects based on student preferences over projects, lecturer preferences over students, and…
Detectability describes the property of a system to uniquely determine, after a finite number of observations, the current and subsequent states. In this paper, to reduce the complexity of checking the detectability properties in the…
Membership diversity is a characteristic aspect of social networks in which a person may belong to more than one social group. For this reason, discovering overlapping structures is necessary for realistic social analysis. In this paper, we…