English
Related papers

Related papers: Well Behaved Transition Systems

200 papers

This paper examines the consistency of w-order by means of a supertask that functions as a supertrap for the assumed existence of w-ordered collections, which are simultaneously complete (as is required by the Actual infinity) and…

General Mathematics · Mathematics 2012-01-30 Antonio Leon

We introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final…

Artificial Intelligence · Computer Science 2013-04-08 Eric J. Horvitz , Jaap Suermondt , Gregory F. Cooper

Reachability problems in infinite-state systems are often subject to extremely high complexity. This motivates the investigation of efficient overapproximations, where we add transitions to obtain a system in which reachability can be…

Formal Languages and Automata Theory · Computer Science 2022-06-28 Moses Ganardi , Rupak Majumdar , Georg Zetzsche

This paper (parts I and II) provides an expository introduction to monotone and near-monotone dynamical systems associated to biochemical networks, those whose graphs are consistent or near-consistent. Many conclusions can be drawn from…

Molecular Networks · Quantitative Biology 2007-05-23 Eduardo D. Sontag

This paper (parts I and II) provides an expository introduction to monotone and near-monotone dynamical systems associated to biochemical networks, those whose graphs are consistent or near-consistent. Many conclusions can be drawn from…

Molecular Networks · Quantitative Biology 2007-05-23 Eduardo D. Sontag

The paper concerns foundations of sensitivity and stability analysis in optimization and related areas, being primarily addressed truncated constrained systems. We consider general models, which are described by multifunctions between…

Optimization and Control · Mathematics 2025-04-30 Boris S. Mordukhovich , Pengcheng Wu , Xiaoqi Yang

We study the recursion-theoretic complexity of Positive Almost-Sure Termination ($\mathsf{PAST}$) in an imperative programming language with rational variables, bounded nondeterministic choice, and discrete probabilistic choice. A program…

Programming Languages · Computer Science 2023-10-30 Rupak Majumdar , V. R. Sathiyanarayana

The problem of robust distributed control arises in several large-scale systems, such as transportation networks and power grid systems. In many practical scenarios controllers might not have enough information to make globally optimal…

Systems and Control · Computer Science 2019-09-26 Luca Furieri , Maryam Kamgarpour

We consider the weighted antimonotone and the weighted monotone satisfiability problems on normalized circuits of depth at most $t \geq 2$, abbreviated {\sc wsat$^-[t]$} and {\sc wsat$^+[t]$}, respectively. These problems model the weighted…

Computational Complexity · Computer Science 2011-12-06 Iyad Kanj , Ge Xia

Families of regimes for control systems are studied possessing the so called quasi-controllability property that is similar to the Kalman controllability property. A new approach is proposed to estimate the degree of transients overshooting…

Optimization and Control · Mathematics 2009-09-25 V. S. Kozyakin , N. A. Kuznetsov , A. V. Pokrovskii

We consider conditions which force a well-quasi-ordered poset (wqo) to be better-quasi-ordered (bqo). In particular we obtain that if a poset $P$ is wqo and the set $S_{\omega}(P)$ of strictly increasing sequences of elements of $P$ is bqo…

Combinatorics · Mathematics 2007-05-23 Maurice Pouzet , Norbert Sauer

In this paper we discuss constraints on two-dimensional quantum-mechanical systems living in domains with boundaries. The constrains result from the requirement of hermicity of corresponding Hamiltonians. We construct new two-dimensional…

Mathematical Physics · Physics 2015-06-26 Sergey Klishevich

Often in Software Engineering, a modeling formalism has to support scenarios of inconsistency in which several requirements either reinforce or contradict each other. Paraconsistent transition systems are proposed in this paper as one such…

Logic in Computer Science · Computer Science 2023-03-24 Ana Cruz , Alexandre Madeira , LuÂ-Ã-s Soares Barbosa

We introduce a self-consistent theory of mobility edges in nearest-neighbour tight-binding chains with quasiperiodic potentials. Demarcating boundaries between localised and extended states in the space of system parameters and energy,…

Disordered Systems and Neural Networks · Physics 2021-02-10 Alexander Duthie , Sthitadhi Roy , David E. Logan

This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-25 Team Rocket , Maofan Yin , Kevin Sekniqi , Robbert van Renesse , Emin Gün Sirer

We prove new characterisations of exponential stability for positive linear discrete-time systems in ordered Banach spaces, in terms of small-gain conditions. Such conditions have played an important role in the finite-dimensional systems…

Functional Analysis · Mathematics 2021-07-19 Jochen Glück , Andrii Mironchenko

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Motivated by the Model-Based Design process for Cyber-Physical Systems, we consider issues in conformance testing of systems. Conformance is a quantitative notion of similarity between the output trajectories of systems, which considers…

Systems and Control · Computer Science 2015-11-19 Houssam Abbas , Georgios Fainekos

Dynamical Systems is a field that studies the collective behavior of objects that update their states according to some rules. Discrete-time Boolean Finite Dynamical System (DT-BFDS) is a subfield where the systems have some finite number…

Computational Complexity · Computer Science 2022-11-16 Mitsunori Ogihara , Kei Uchizawa

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi
‹ Prev 1 4 5 6 7 8 10 Next ›