In this paper we study the problem of enforcing a generalized mutual exclusion constraint
(GMEC) in a labeled Petri net that contains indistinguishable transitions by a monitor-based …

In this paper we investigate a supervisory control problem of discrete event systems under
attacks. Specially, we consider a type of sensor deception attacks, called replacement …

We investigate the properties of formal languages expressible in terms of formulas over
quantifier-free theories of word equations, arithmetic over length constraints, and language …

In this paper we propose a method to compute a monitor-based supervisor that enforces a
GMEC in labelled Petri nets. Due to the presence of indistinguishable transitions, an …

Computational knot theory and 3-manifold topology have seen significant breakthroughs in
recent years, despite the fact that many key algorithms have complexity bounds that are …

Normal surfaces are a key tool in computational knot theory and 3-manifold topology, and
have featured in significant computational breakthroughs in recent years. Despite this, there …

A transition t stops a place/transition Petri net if each reachable marking of the net enables
only finite occurrence sequences without occurrences of t (ie, every infinite occurrence …

In this thesis, we propose an exact solution path algorithm of Generalized Lasso when the
design matrix $ X $ is non-full rank.\newline In the case of non-full rank, the conventional …

A transition t eventually stops a place/transition Petri net if each reachable marking of the net
enables only finite occurrence sequences without occurrences of t (ie, every infinite …

Identifying performance bottlenecks of modern, distributed stream processing engines is a
serious challenge. At the same time, such engines are widely used to perform data-parallel …