Related papers: On the Home-Space Problem for Petri Nets and its A…
The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its…
We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson's group F. We find geometric criteria…
We study the Stable Fixtures problem, a many-to-many generalisation of the classical non-bipartite Stable Roommates matching problem. Building on the foundational work of Tan on stable partitions, we extend his results to this significantly…
In this paper, we consider families of linear systems (linear ensembles) defined by matrix pairs $\big( A(\theta),B(\theta) \big)$ depending on a parameter $\theta \in \p$ that is varying over a compact subset $\p$ of the complex plane. In…
The reachability problem in vector addition systems is a central question, not only for the static verification of these systems, but also for many inter-reducible decision problems occurring in various fields. The currently best known…
A Petri net is choice-free if any place has at most one transition in its postset (consuming its tokens) and it is (extended) free-choice (EFC) if the postsets of any two places are either equal or disjoint. Asymmetric choice (AC) extends…
Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Often, it is natural and desirable to require that these structures have small hop length or hop diameter. Unfortunately, optimization problems…
In this paper, we study networks of discrete-time linear time-invariant subsystems. Our focus is on situations where subsystems are connected to each other through a time-invariant topology and where there exists a base-station whose aim is…
Recently introduced Petri net-based formalisms advocate the importance of proper representation and management of case objects as well as their co-evolution. In this work we build on top of one of such formalisms and introduce the notion of…
We show that the topological complexity of an aspherical space $X$ is bounded below by the cohomological dimension of the direct product $A\times B$, whenever $A$ and $B$ are subgroups of $\pi_1(X)$ whose conjugates intersect trivially. For…
Assigning a satisfactory truly concurrent semantics to Petri nets with confusion and distributed decisions is a long standing problem, especially if one wants to resolve decisions by drawing from some probability distribution. Here we…
We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we…
The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions,…
Let $X$ be a metrizable space and ${\rm Comp}(X)$ be the hyperspace consisting of non-empty compact subsets of $X$ endowed with the Vietoris topology. In this paper, we give a necessary and sufficient condition on $X$ for ${\rm Comp}(X)$ to…
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or…
The Mermin-Peres magic square is a celebrated example of a system of Boolean linear equations that is not (classically) satisfiable but is satisfiable via linear operators on a Hilbert space of dimension four. A natural question is then,…
This paper deals with the reachability analysis of {P,A}-Time Petri nets ({P,A}-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set…
We propose a method to count the number of reachable markings of a Petri net without having to enumerate these rst. The method relies on a structural reduction system that reduces the number of places and transitions of the net in such a…
We prove that the set of $n$-point configurations for which the solution of the planar Steiner problem is not unique has the Hausdorff dimension at most $2n-1$ (as a subset of $\mathbb{R}^{2n}$). Moreover, we show that the Hausdorff…
Critical observability is a property of cyber-physical systems to detect whether the current state belongs to a set of critical states. In safety-critical applications, critical states model operations that may be unsafe or of a particular…