English
Related papers

Related papers: Complete FSM Testing Using Strong Separability

200 papers

Using new results on the separability properties of bosonic systems, we provide a new complete criterion for separability. This criterion aims at characterizing the set of separable states from the inside by means of a sequence of…

Quantum Physics · Physics 2013-05-29 Miguel Navascues , Masaki Owari , Martin B. Plenio

For partial, nondeterministic, finite state machines, a new conformance relation called strong reduction is presented. It complements other existing conformance relations in the sense that the new relation is well-suited for model-based…

Software Engineering · Computer Science 2021-06-29 Robert Sachtleben , Jan Peleska

A fault domain reflects a tester's assumptions about faults that may occur in an implementation and that need to be detected during testing. A fault domain that has been widely studied in the literature on black-box conformance testing is…

Formal Languages and Automata Theory · Computer Science 2025-06-13 Frits Vaandrager , Ivo Melse

We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…

Optimization and Control · Mathematics 2018-03-05 Murat Cubuktepe , Mohamadreza Ahmadi , Ufuk Topcu , Brandon Hencey

Test of independence is of fundamental importance in modern data analysis, with broad applications in variable selection, graphical models, and causal inference. When the data is high dimensional and the potential dependence signal is…

Methodology · Statistics 2023-06-13 Zhanrui Cai , Jing Lei , Kathryn Roeder

In machine learning, the performance of a classifier depends on both the classifier model and the separability/complexity of datasets. To quantitatively measure the separability of datasets, we create an intrinsic measure -- the…

Machine Learning · Computer Science 2021-09-14 Shuyue Guan , Murray Loew

The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP).…

The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in…

Quantum Physics · Physics 2020-07-15 Ying Li , Guyan Ni

The emergence of quantum devices has raised a significant issue: how to certify the quantum properties of a device without placing trust in it. To characterise quantum states and measurements in a device-independent way, up to some degree…

Quantum Physics · Physics 2026-03-05 Shubhayan Sarkar , Alexandre C. Orthey, , Remigiusz Augusiak

Self-testing is a phenomenon where the use of specific quantum states or measurements can be inferred solely from the correlations they generate. We introduce a universal method for conducting robustness analysis in the self-testing of…

Quantum Physics · Physics 2026-03-23 Shin-Liang Chen , Nikolai Miklin

We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all…

Quantum Physics · Physics 2007-05-23 Andrew C. Doherty , Pablo A. Parrilo , Federico M. Spedalieri

We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…

Quantum Physics · Physics 2018-06-29 Antoine Neven , Thierry Bastin

Deep learning methods have proved highly effective for classification and image recognition problems. In this paper, we ask whether this success can be transferred to hypothesis testing: if a neural network can distinguish, for example, an…

Machine Learning · Statistics 2026-04-30 Gery Geenens , Pierre Lafaye de Micheaux , Ivan Muyun Zou

We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…

Logic · Mathematics 2023-10-26 Benno van den Berg

Methods of performing anomaly detection on high-dimensional data sets are needed, since algorithms which are trained on data are only expected to perform well on data that is similar to the training data. There are theoretical results on…

Machine Learning · Computer Science 2020-11-13 Forrest Laine , Claire Tomlin

Model-based Testing (MBT) is an effective approach for testing when parts of a system-under-test have the characteristics of a finite state machine (FSM). Despite various strategies in the literature on this topic, little work exists to…

Software Engineering · Computer Science 2022-04-05 Vaclav Rechtberger , Miroslav Bures , Bestoun S. Ahmed , Youcef Belkhier , Jiri Nema , Hynek Schvach

In Model-Based Design of Cyber-Physical Systems (CPS), it is often desirable to develop several models of varying fidelity. Models of different fidelity levels can enable mathematical analysis of the model, control synthesis, faster…

Systems and Control · Computer Science 2014-06-03 Houssam Abbas , Bardh Hoxha , Georgios Fainekos , Jyotirmoy V. Deshmukh , James Kapinski , Koichi Ueda

Adversarial attack perturbs an image with an imperceptible noise, leading to incorrect model prediction. Recently, a few works showed inherent bias associated with such attack (robustness bias), where certain subgroups in a dataset (e.g.…

Computer Vision and Pattern Recognition · Computer Science 2022-05-06 Gaurav Kumar Nayak , Ruchit Rawal , Rohit Lal , Himanshu Patil , Anirban Chakraborty

The contribution of this paper is threefold: first, it defines a framework for modelling component-based systems, as well as a formalization of integration rules to combine their behavior. This is based on finite state machines (FSM).…

Software Engineering · Computer Science 2014-06-12 Bilal Kanso , Omar Chebaro

Coherent superpositions are one of the hallmarks of quantum mechanics and are vital for any quantum mechanical device to outperform the classically achievable. Generically, superpositions are verified in interference experiments, but…

Quantum Physics · Physics 2020-03-04 Benjamin Dive , Nikolaos Koukoulekidis , Stefanos Mousafeiris , Florian Mintert
‹ Prev 1 2 3 10 Next ›