Related papers: Non-Blockingness Verification of Bounded Petri Net…
Robustness verification that aims to formally certify the prediction behavior of neural networks has become an important tool for understanding model behavior and obtaining safety guarantees. However, previous methods can usually only…
Boolean Petri nets are differentiated by types of nets $\tau$ based on which of the interactions nop, inp, out, set, res, swap, used, and free they apply or spare. The synthesis problem relative to a specific type of nets $\tau$ is to find…
Hyperproperties are system properties that require quantification over multiple execution traces of a system. Hyperproperties can express several specifications of interest for cyber-physical systems--such as opacity, robustness, and…
Stochastic Petri nets are commonly used for modeling distributed systems in order to study their performance and dependability. This paper proposes a realization of stochastic Petri nets in SystemC for modeling large embedded control…
Safety-critical applications are required to perform as expected in normal operations. Image processing functions are often required to be insensitive to small geometric perturbations such as rotation, scaling, shearing or translation. This…
In this thesis a comprehensive verification framework is proposed to contend with some important issues in composability verification and a verification process is suggested to verify composability of different kinds of systems models, such…
For a fixed type of Petri nets $\tau$, \textsc{$\tau$-Synthesis} is the task of finding for a given transition system $A$ a Petri net $N$ of type $\tau$ ($\tau$-net, for short) whose reachability graph is isomorphic to $A$ if there is one.…
This paper introduces a new and ubiquitous framework for establishing achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and…
We give a Hasse-diagram characterization of when a clustering system $\mathcal C$ on a finite taxa set $X$ is the hardwired clustering system $C_N$ of a rooted level-$k$ network. For each non-trivial block $B$ of $H=\mathcal H[\mathcal C]$,…
Cascading failures are the typical reasons of black- outs in power grids. The grid topology plays an important role in determining the dynamics of cascading failures in power grids. Measures for vulnerability analysis are crucial to assure…
Conformance checking techniques aim to provide diagnostics on the conformity between process models and event data. Conventional methods, such as trace alignments, assume strict total ordering of events, leading to inaccuracies when…
Deep neural networks can be trained to be efficient and effective controllers for dynamical systems; however, the mechanics of deep neural networks are complex and difficult to guarantee. This work presents a general approach for providing…
Connectivity and diagnosability are important parameters in measuring the fault tolerance and reliability of interconnection networks. The $R^g$-vertex-connectivity of a connected graph $G$ is the minimum cardinality of a faulty set…
The operability of a network concerns its ability to remain operational, despite possible failures in its links or equipment. One may model the network through a graph to evaluate and increase this operability. Its vertices and edges…
We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and…
Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its…
Quantifying uncertainty in networks is an important step in modelling relationships and interactions between entities. We consider the challenge of bootstrapping an inhomogeneous random graph when only a single observation of the network is…
A block graph is a graph in which every block is a complete graph. Let $G$ be a block graph and let $A(G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular) if $A(G)$ is nonsingular (singular). Characterizing…
We address the problem of statically checking control state reachability (as in possibility of assertion violations, race conditions or runtime errors) and plain reachability (as in deadlock-freedom) of phaser programs. Phasers are a modern…
In this paper, we show how informativity and identifiability for networks of dynamical systems can be investigated using Gr\"obner bases. We provide a sufficient condition for informativity in terms of positive definiteness of the spectrum…