English
Related papers

Related papers: A Lower Bound on Conservative Elementary Object Sy…

200 papers

We propose a method for checking generalized reachability properties in Petri nets that takes advantage of structural reductions and that can be used, transparently, as a pre-processing step of existing model-checkers. Our approach is based…

Logic in Computer Science · Computer Science 2024-01-09 Nicolas Amat , Silvano Dal Zilio , Didier Le Botlan

The increasing prevalence of neural networks in safety-critical control systems underscores the imperative need for rigorous methods to ensure the reliability and safety of these systems. This work introduces a novel approach employing…

Optimization and Control · Mathematics 2024-03-20 Hang Zhang , Yuhao Zhang , Xiangru Xu

The coverability and boundedness problems for Petri nets are known to be Expspace-complete. Given a Petri net, we associate a graph with it. With the vertex cover number k of this graph and the maximum arc weight W as parameters, we show…

Data Structures and Algorithms · Computer Science 2015-05-19 M. Praveen

Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an…

Cryptography and Security · Computer Science 2014-09-02 Béatrice Bérard , Krishnendu Chatterjee , Nathalie Sznajder

As cyber-physical systems (CPSs) become more dependent on data and communication networks, their vulnerability to false data injection (FDI) attacks has raised significant concerns. Among these, stealthy attacks, those that evade…

Systems and Control · Electrical Eng. & Systems 2025-12-16 Mischa Huisman , Erjen Lefeber , Nathan van de Wouw , Carlos Murguia

The increasing prevalence of neural networks (NNs) in safety-critical applications calls for methods to certify their behavior and guarantee safety. This paper presents a backward reachability approach for safety verification of neural…

Systems and Control · Electrical Eng. & Systems 2022-11-22 Nicholas Rober , Michael Everett , Jonathan P. How

Current state-of-the-art object proposal networks are trained with a closed-world assumption, meaning they learn to only detect objects of the training classes. These models fail to provide high recall in open-world environments where…

Computer Vision and Pattern Recognition · Computer Science 2024-04-18 Matthew Inkawhich , Nathan Inkawhich , Hai Li , Yiran Chen

Off-policy evaluation (OPE) in both contextual bandits and reinforcement learning allows one to evaluate novel decision policies without needing to conduct exploration, which is often costly or otherwise infeasible. The problem's importance…

Machine Learning · Computer Science 2019-06-11 Nathan Kallus , Masatoshi Uehara

Deep neural networks (DNNs) are reshaping the field of information processing. With their exponential growth challenging existing electronic hardware, optical neural networks (ONNs) are emerging to process DNN tasks in the optical domain…

Neutron stars are compact objects of large interest in the nuclear astrophysics community. The extreme conditions present in such systems impose big challenges to our current microscopic models of nuclear structure. Equation of states (EoS)…

Nuclear Theory · Physics 2022-03-01 Ronaldo V. Lobato , Emanuel V. Chimanski , Carlos A. Bertulani

Broadcast networks allow one to model networks of identical nodes communicating through message broadcasts. Their parameterized verification aims at proving a property holds for any number of nodes, under any communication topology, and on…

Logic in Computer Science · Computer Science 2023-06-22 Nathalie Bertrand , Patricia Bouyer , Anirban Majumdar

Detectability of discrete event systems (DESs) is a property to determine a priori whether the current and subsequent states can be determined based on observations. In this paper, we investigate the verification of two detectability…

Logic in Computer Science · Computer Science 2018-11-30 Tomas Masopust , Xiang Yin

The expressibility of an ansatz used in a variational quantum algorithm is defined as the uniformity with which it can explore the space of unitary matrices, i.e., its covering number. The expressibility of a particular ansatz has a…

Quantum Physics · Physics 2025-01-09 Tamojit Ghosh , Arijit Mandal , Shreya Banerjee , Neetik Mukherjee , Prasanta K. Panigrahi

The analysis of biological networks has benefited from the richness of Boolean networks (BNs) and the associated theory. These results have been further fortified in recent years by the emergence of Most Permissive (MP) semantics, combining…

Discrete Mathematics · Computer Science 2025-05-26 Stefan Haar , Juri Kolčák

Exceptional points (EPs) are singularities that arise in non-Hermitian physics. Current research efforts focus only on systems supporting isolated EPs characterized by increased sensitivity to external perturbations, which makes them…

The difficulty in describing the equation of state (EoS) for nuclear matter at densities above the saturation density ($\rho_0$) has led to the emergence of a multitude of models based on different assumptions and techniques. These EoSs,…

Nuclear Theory · Physics 2024-01-17 Ameya Thete , Kinjal Banerjee , Tuhin Malik

We study verification problems for history-constrained systems (HCS), a model of guarded computation that uses nested systems. An outer system describes the process architecture in which a sequence of actions represents the communication…

Formal Languages and Automata Theory · Computer Science 2026-02-23 Louwe B. Kuijer , David Purser , Henry Sinclair-Banks , Patrick Totzke

With the wide/rapid spread of distributed systems for information processing, such as cloud computing and social networking, not only transmission but also processing is done on the internet. Therefore, a lot of studies on secure, efficient…

Cryptography and Security · Computer Science 2018-11-27 Hitoshi Kiya

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors.…

Quantum Physics · Physics 2022-08-03 Thomas Barthel , Jianfeng Lu , Gero Friesecke

A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no…

Formal Languages and Automata Theory · Computer Science 2022-09-22 Giann Karlo Aguirre-Samboní , Stefan Haar , Loïc Paulevé , Stefan Schwoon , Nick Würdemann
‹ Prev 1 8 9 10 Next ›