English
Related papers

Related papers: Coalgebraic Weak Bisimulation from Recursive Equat…

200 papers

Weak supersolutions to the porous medium equation are defined by means of smooth test functions under an integral sign. We show that nonnegative weak supersolutions become lower semicontinuous after redefinition on a set of measure zero.…

Analysis of PDEs · Mathematics 2013-12-11 Benny Avelin , Teemu Lukkari

We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS…

Logic in Computer Science · Computer Science 2019-08-30 Tom Hirschowitz

We prove that for any $C^1$-stably weakly shadowing transitive set $\Lambda$, either $\Lambda$ is a sink or a source, or $\Lambda$ admits a dominated splitting.

Dynamical Systems · Mathematics 2010-03-11 Dawei Yang

We consider a class of cross diffusion systems with degenerate (or porous media type) diffusion which is inspired by models in mathematical biology/ecology with zero self diffusions. Known techniques for scalar equations are no longer…

Analysis of PDEs · Mathematics 2019-09-12 Dung Le

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

The standard engineering approach to modelling of complex systems is highly compositional. In order to be able to understand (or to control) the behavior of a complex dynamical systems, it is often desirable, if not necessary, to view this…

Systems and Control · Computer Science 2013-07-01 Antoine Girard

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

Logic · Mathematics 2021-06-01 Slavko Moconja , Predrag Tanović

We consider reasoning and minimization in systems of polynomial ordinary differential equations (ode's). The ring of multivariate polynomials is employed as a syntax for denoting system behaviours. We endow this set with a transition system…

Logic in Computer Science · Computer Science 2023-06-22 Michele Boreale

The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…

Logic · Mathematics 2015-02-10 Janis Cirulis

We prove that a weak equivalence between cofibrant props induces a weak equivalence between the associated classifying spaces of algebras. This statement generalizes to the prop setting a homotopy invariance result which is well known in…

Algebraic Topology · Mathematics 2016-01-20 Sinan Yalin

Reductions for transition systems have been recently introduced as a uniform and principled method for comparing the expressiveness of system models with respect to a range of properties, especially bisimulations. In this paper we study the…

Logic in Computer Science · Computer Science 2017-05-19 Marco Peressotti

The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient…

We extend all known results about transferred model structures on algebraically cofibrant and fibrant objects by working with weak model categories. We show that for an accessible weak model category there are always Quillen equivalent…

Category Theory · Mathematics 2020-05-13 John Bourke , Simon Henry

Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques in a fibrational setting,…

Logic in Computer Science · Computer Science 2014-05-16 Filippo Bonchi , Daniela Petrisan , Damien Pous , Jurriaan Rot

Toric differential inclusions play a pivotal role in providing a rigorous interpretation of the connection between weak reversibility and the persistence of mass-action systems and polynomial dynamical systems. We introduce the notion of…

Dynamical Systems · Mathematics 2019-10-15 Gheorghe Craciun , Abhishek Deshpande , Hyejin Jenny Yeon

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that…

Programming Languages · Computer Science 2023-09-29 Henning Urbat , Stelios Tsampas , Sergey Goncharov , Stefan Milius , Lutz Schröder

Batanin and Leinster's work on globular operads has provided one of many potential defnitions of a weak $\omega$-category. Through the language of globular operads they construct a monad whose algebras encode weak $\omega$-categories. The…

Category Theory · Mathematics 2023-09-19 Phillip M Bressie

We study a nonconventional ergodic average for asymptotically abelian weakly mixing C*-dynamical systems, related to a second iteration of Khintchine's recurrence theorem obtained by Bergelson in the measure theoretic case. A noncommutative…

Operator Algebras · Mathematics 2009-06-22 Rocco Duvenhage

Recently, some general frameworks have been proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and…

Logic in Computer Science · Computer Science 2014-06-10 Marino Miculan , Marco Peressotti

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

Logic · Mathematics 2026-01-21 Ivo Düntsch , Rafał Gruszczyński , Paula Menchón