English
Related papers

Related papers: Well Behaved Transition Systems

200 papers

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

Dynamical Systems · Mathematics 2024-06-07 Nicolás Bitar

Bayesian Belief Networks (BBNs) are a powerful formalism for reasoning under uncertainty but bear some severe limitations: they require a large amount of information before any reasoning process can start, they have limited contradiction…

Artificial Intelligence · Computer Science 2013-02-28 Marco Ramoni , Alberto Riva

A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. We introduce and study…

Optimization and Control · Mathematics 2016-10-19 Fabio Somenzi , Behrouz Touri , Ashutosh Trivedi

Regular model checking is a well-established technique for the verification of regular transition systems (RTS): transition systems whose initial configurations and transition relation can be effectively encoded as regular languages. In…

Formal Languages and Automata Theory · Computer Science 2025-06-24 Javier Esparza , Valentin Krasotin

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems…

Logic in Computer Science · Computer Science 2020-09-24 Patricia Bouyer , Thomas Brihaye , Mickael Randour , Cédric Rivière , Pierre Vandenhove

Time-optimal control for high-order chain-of-integrator systems with full state constraints remains an open and challenging problem within the discipline of optimal control. The behavior of optimal control in high-order problems lacks…

Optimization and Control · Mathematics 2025-02-13 Yunan Wang , Chuxiong Hu , Zeyang Li , Yujie Lin , Shize Lin , Suqin He

It has recently been shown that structural conditions on the reaction network, rather than a 'fine-tuning' of system parameters, often suffice to impart 'absolute concentration robustness' on a wide class of biologically relevant,…

Probability · Mathematics 2014-01-20 David F. Anderson , German Enciso , Matthew Johnston

A spatially extended classical system with metastable states subject to weak spatiotemporal noise can exhibit a transition in its activation behavior when one or more external parameters are varied. Depending on the potential, the…

Statistical Mechanics · Physics 2008-07-09 J. Bürki , C. A. Stafford , D. L. Stein

Well-posedness and uniform-in-time boundedness of classical solutions are investigated for a three-component parabolic system which describes the dynamics of a population of cells interacting with a chemoattractant and a nutrient. The…

Analysis of PDEs · Mathematics 2021-06-07 Jie Jiang , Philippe Laurençot , Yanyan Zhang

Hybrid systems - more precisely, their mathematical models - can exhibit behaviors, like Zeno behaviors, that are absent in purely discrete or purely continuous systems. First, we observe that, in this context, the usual definition of…

Logic in Computer Science · Computer Science 2018-09-05 Eugenio Moggi , Amin Farjudian , Adam Duracz , Walid Taha

This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and "Forward Analysis for WSTS, Part II: Complete WSTS" [Logical Methods in Computer Science 8(3), 2012]. In…

Logic in Computer Science · Computer Science 2023-06-22 Michael Blondin , Alain Finkel , Jean Goubault-Larrecq

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels that are structurally simple, gauged by certain types of…

Logic in Computer Science · Computer Science 2025-04-30 Thomas Feller , Tim S. Lyon , Piotr Ostropolski-Nalewaja , Sebastian Rudolph

By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in…

Logic in Computer Science · Computer Science 2011-06-28 Yohji Akama

Many real-world systems are characterized by stochastic dynamical rules where a complex network of interactions among individual elements probabilistically determines their state. Even with full knowledge of the network structure and of the…

Physics and Society · Physics 2018-05-15 Filippo Radicchi , Claudio Castellano

In this paper, we study properties of sensitivity, transitivity and chaos for non-autonomous discrete systems(NDS). Firstly, we present some different sufficient conditions for NDS to be chaotic. Then, we relate the transitivity with the…

Dynamical Systems · Mathematics 2024-10-18 Hongbo Zeng

We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…

Dynamical Systems · Mathematics 2015-12-16 Matthew Philippe , Gilles Millerioux , Raphaël M. Jungers

In this paper, we introduce a versatile scheme for optimizing the arrival rates of quasi-reversible queueing systems. We first propose an alternative definition of quasi-reversibility that encompasses reversibility and highlights the…

Machine Learning · Computer Science 2026-03-17 Céline Comte , Pascal Moyal

Mott physics is at the root of a plethora of many-body quantum phenomena in quantum materials. Recently, the stacked or twisted structures of van der Waals (vdW) materials have emerged as a unique platform for realizing exotic correlated…

This paper concerns the recently proposed quasi-balanced truncation model reduction method for linear quantum stochastic systems. It has previously been shown that the quasi-balanceable class of systems (i.e. systems that can be truncated…

Quantum Physics · Physics 2014-08-11 Onvaree Techakesari , Hendra I. Nurdin

Supertask theory is used here to prove a contradictory result which involves the consistency of w-order and the Axiom of Infinity.

General Mathematics · Mathematics 2012-01-30 Antonio Leon