English
Related papers

Related papers: Proof of Compositionality of CFT Correctness

200 papers

This article is a supplementary document for the CoPPar Tree paper, providing a detailed correctness proof for the CoPPar architecture.

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-26 Xincheng Yang , Kyle Hale

We derive consistency conditions for the CFT data, which systems with exact but spontaneously broken conformal invariance must satisfy.

High Energy Physics - Theory · Physics 2018-02-13 Georgios K. Karananas , Mikhail Shaposhnikov

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

We provide a rigorous framework for handling uncertainty in quantitative fault tree analysis based on fuzzy theory. We show that any algorithm for fault tree unreliability analysis can be adapted to this framework in a fully general and…

General Mathematics · Mathematics 2026-01-29 Thi Kim Nhung Dang , Benedikt Peterseim , Milan Lopuhaä-Zwakenberg , Mariëlle Stoelinga

We prove that functionality of compositions of top-down tree transducers is decidable by reducing the problem to the functionality of one top-down tree transducer with look-ahead.

Formal Languages and Automata Theory · Computer Science 2022-09-05 Sebastian Maneth , Helmut Seidl , Martin Vu

In this letter we examine some structural aspects of the AdS/CFT such as the way of obtaining the expectation value of product of operators of the CFT, and ideas that should be considered when a proof of AdS/CFT is under consideration.

High Energy Physics - Theory · Physics 2019-05-22 Leonardo Ortíz

It is known that for any full rational conformal field theory, the correlation functions that are obtained by the TFT construction satisfy all locality, modular invariance and factorization conditions, and that there is a small set of…

High Energy Physics - Theory · Physics 2015-06-04 Jens Fjelstad , Jurgen Fuchs , Carl Stigner

We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.

Algebraic Geometry · Mathematics 2007-11-29 Fernado Sancho , Pedro Sancho

This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with…

Metric Geometry · Mathematics 2020-10-20 Yann Lanoiselee , Laurent Nivanen , Aziz El Kaabouchi , Qiuping A. Wang

Safety-critical infrastructures must operate safely and reliably. Fault tree analysis is a widespread method used to assess risks in these systems: fault trees (FTs) are required - among others - by the Federal Aviation Authority, the…

Software Engineering · Computer Science 2024-06-04 Stefano M. Nicoletti , E. Moritz Hahn , Marielle Stoelinga

Fault Tree Analysis (FTA) is a dependability analysis technique that has been widely used to predict reliability, availability and safety of many complex engineering systems. Traditionally, these FTA-based analyses are done using…

Logic in Computer Science · Computer Science 2015-05-12 Waqar Ahmed , Osman Hasan

The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…

General Mathematics · Mathematics 2020-11-03 James David Nixon

We show that it is coNP-complete to decide whether a given proof structure of pomset logic is a correct proof net, using the graph-theoretic used in a previous paper of ours (arXiv:1901.10247).

Logic in Computer Science · Computer Science 2023-01-24 Lê Thành Dũng Nguyên

It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…

Logic in Computer Science · Computer Science 2017-01-11 Jean Gallier

Dynamic fault trees (DFTs) have emerged as an important tool for capturing the dynamic behavior of system failure. These DFTs are then analyzed qualitatively and quantitatively using stochastic or algebraic methods to judge the failure…

Logic in Computer Science · Computer Science 2017-12-11 Yassmeen Elderhalli , Osman Hasan , Waqar Ahmad , Sofiene Tahar

Fault Tree (FT) is a standard failure modeling technique that has been extensively used to predict reliability, availability and safety of many complex engineering systems. In order to facilitate the formal analysis of FT based analyses, a…

Logic in Computer Science · Computer Science 2016-08-24 Waqar Ahmed , Osman Hasan

G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…

Logic · Mathematics 2023-02-20 David O. Zisselman

We explore higher-dimensional conformal field theories (CFTs) in the presence of a conformal defect that itself hosts another sub-dimensional defect. We refer to this new kind of conformal defect as the composite defect. We elaborate on the…

High Energy Physics - Theory · Physics 2024-04-26 Soichiro Shimamori

We consider the set of partition functions that result from the insertion of twist operators compatible with conformal invariance in a given 2D Conformal Field Theory (CFT). A consistency equation, which gives a classification of twists, is…

High Energy Physics - Theory · Physics 2009-10-31 V. B. Petkova , J. -B. Zuber

In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…

Probability · Mathematics 2009-12-21 Hayato Saigo
‹ Prev 1 2 3 10 Next ›