Related papers: Homogeneous Equations of Algebraic Petri Nets
There is a well studied notion of GIT-stability for coherent systems over curves, which depends on a real parameter $\alpha$. For generated coherent systems, there is a further notion of stability derived from Mumford's definition of linear…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
In this paper we investigate equilibria of continuous differential equation models of network dynamics. The motivation comes from gene regulatory networks where each directed edge represents either down- or up-regulation, and is modeled by…
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…
Let $S$ be an algebraic semigroup (not necessarily linear) defined over a field $F$. We show that there exists a positive integer $n$ such that $x^n$ belongs to a subgroup of $S(F)$ for any $x \in S(F)$. In particular, the semigroup $S(F)$…
The concept of must testing is naturally parametrised with a chosen completeness criterion, defining the complete runs of a system. Here I employ justness as this completeness criterion, instead of the traditional choice of progress. The…
We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…
Motivated by the ubiquitous sampled-data setup in applied control, we examine the stability of a class of difference equations that arises by sampling a right- or left-invariant flow on a matrix Lie group. The map defining such a difference…
A net in $\mathbb{P}^2$ is a configuration of lines $\mathcal A$ and points $X$ satisfying certain incidence properties. Nets appear in a variety of settings, ranging from quasigroups to combinatorial design to classification of Kac-Moody…
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…
In this work we examine the stability of some classes of integrals, and in particular with respect to homogenization. The prototypical case is the homogenization of quadratic energies with periodic coefficients perturbed by a term vanishing…
In contrast to the prevailing view in the literature, it is shown that even extremely stiff sets of ordinary differential equations may be solved efficiently by explicit methods if limiting algebraic solutions are used to stabilize the…
We prove regularity and stochastic homogenization results for certain degenerate elliptic equations in nondivergence form. The equation is required to be strictly elliptic, but the ellipticity may oscillate on the microscopic scale and is…
We prove new homological stability results for general linear groups over finite fields. These results are obtained by constructing CW approximations to the classifying spaces of these groups, in the category of $E_\infty$-algebras, guided…
We study algebras encoding stable range branching rules for the pairs of complex classical groups of the same type in the context of toric degenerations of spherical varieties. By lifting affine semigroup algebras constructed from…
We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and f is a non-trivial irreducible…
The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…
Homology groups of labelled asynchronous transition systems and Petri nets are introduced. Examples of computing the homology groups are given. It is proved that if labelled asynchronous transition systems are bisimulation equivalent, then…
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…
We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe changes in behaviour of individual nodes, communities, or the entire graph. Given this…