Related papers: Separators in Continuous Petri Nets
The class of port-Hamiltonian systems incorporates many physical models, such as mechanical systems in the finite-dimensional case and wave and beam equations in the infinite-dimensional case. In this paper we study a subclass of linear…
In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specifications of allowed inputs and outputs in form of Linear…
We propose a unifying approach to the separability problem using covariance matrices of locally measurable observables. From a practical point of view, our approach leads to strong entanglement criteria that allow to detect the entanglement…
Let $\mathcal{M}$ be a semifinite von Neumann algebra equipped with a normal faithful semifinite trace $\tau$, and let $L_p(\mathcal{M})$ denote the associated noncommutative $L_p$-space for $1<p<\infty$. Let $n\in\mathbb{N}$ and let $a, b$…
Since Littlewood works in the 1960's, the boundedness of solutions of Duffing-type equations $\ddot{x}+g(x)=p(t)$ has been extensively investigated. More recently, some researches have focused on the family of non-smooth forced oscillators…
Let $G$ be a locally compact unimodular group, let $1\leq p<\infty$,let $\phi\in L^\infty(G)$ and assume that the Fourier multiplier $M_\phi$associated with $\phi$ is bounded on the noncommutative $L^p$-space $L^p(VN(G))$.Then $M_\phi\colon…
The time complexity of the presented in 2013 by the author small universal Petri nets with the pairs of places/transitions numbers (14,42) and (14,29) was estimated as exponential. In the present paper, it is shown, that their slight…
The continuous evolution of a wide variety of systems, including continuous-time Markov chains and linear hybrid automata, can be described in terms of linear differential equations. In this paper we study the decision problem of whether…
We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by…
We consider the problem of determining the presence of genuine multipartite entanglement through the violation of Mermin's Bell-type inequality (MI). Though the violation of MI cannot certify the presence of genuine nonlocality, but can…
A fundamental issue in the analysis of emergency call centers is to estimate the time needed to return to a congestion-free regime after an unusual event with a massive arrival of calls. Call centers can generally be represented by timed…
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 introduce stochastic decision Petri nets (SDPNs), which are a form of stochastic Petri nets equipped with rewards and a control mechanism via the deactivation of controllable transitions. Such nets can be translated into Markov decision…
Consider two entities with constant but not necessarily equal velocities, moving on two given piece-wise linear trajectories inside a simple polygon $P$. The Trajectory Range Visibility problem deals with determining the sub-trajectories on…
We investigate the connections between the fields of distributed computing and measurable combinatorics by considering complexity classes of locally checkable labeling problems on regular forests. We show that the most important…
Concurrent programming is used in all large and complex computer systems. However, concurrency errors and system failures (ex: crashes and deadlocks) are common. We find that Petri nets can be used to model concurrent systems and find and…
This article focuses on comparing the notions of home spaces and invariants, in Transition Systems and more particularly, in Petri Nets as well as a variety of derived Petri Nets. After recalling basic notions of Petri Nets and semiflows,…
In previous studies, several methods have been developed to synthesise Petri nets from labelled transition systems (LTS), often with structural constraints on the net and on the LTS. In this paper, we focus on Weighted Marked Graphs (WMGs)…
We consider the Hartree equation for infinitely many electrons with a constant external magnetic field. For the system, we show a local well-posedness result when the initial data is the pertubation of a Fermi sea, which is a non-trace…
We consider the precision $\Delta \varphi$ with which the parameter $\varphi$, appearing in the unitary map $U_\varphi = e^{ i \varphi \Lambda}$ acting on some type of probe system, can be estimated when there is a finite amount of prior…