A5019902087- Formal Methods in Verification
- Computability, Logic, AI Algorithms
- Logic, programming, and type systems
- Petri Nets in System Modeling
- Advanced Topology and Set Theory
- Mathematical Dynamics and Fractals
- Advanced Control Systems Optimization
- Quantum chaos and dynamical systems
- Logic, Reasoning, and Knowledge
- Cellular Automata and Applications
- Homotopy and Cohomology in Algebraic Topology
- Numerical Methods and Algorithms
- Renaissance and Early Modern Studies
- Renaissance Literature and Culture
- Advanced Algebra and Logic
- Gene Regulatory Network Analysis
- Fuzzy and Soft Set Theory
- Chaos control and synchronization
- Control Systems and Identification
- Rings, Modules, and Algebras
- Mathematical and Theoretical Analysis
- Geometric and Algebraic Topology
- Embedded Systems Design Techniques
- semigroups and automata theory
- Advanced Topics in Algebra
Maastricht University
2015-2024
ATA Engineering (United States)
2019
Centrum Wiskunde & Informatica
2002-2011
Vitenparken
2010-2011
University of Oxford
1971-2003
University of Liverpool
2001-2002
Berkeley College
2001
Instituto Superior Técnico
2001
Instituto Politécnico de Lisboa
2001
Princeton University
2001
In this paper, we consider the synthesis of control laws for piecewise-affine hybrid systems on simplices. The construction is based solution to control-to-facet problem at continuous level, and dynamic programming discrete level. given as an explicit algorithm using only linear algebra reach-set computations automata; no numerical integration required. method conservative, in that it may fail find a law where one exists, but cannot hope sharp since reachability undecidable.
SUMMARY In many applicative fields, there is the need to model and design complex systems having a mixed discrete continuous behavior that cannot be characterized faithfully using either or models only. Such consist of control part operates in environment are named hybrid because their nature. Unfortunately, most verification problems for systems, like reachability analysis, turn out undecidable. Because this, approximation techniques tools estimate reachable set have been proposed...
A simple condition on the local bases of a first countable space is shown to imply metrisability, and some new well-known metrisation theorems are deduced. Weakening gives classes spaces distinct from class metrisable spaces.
Abstract Mutations in SCN5A can alter the cardiac sodium current I Na and increase risk of potentially lethal conditions such as Brugada long-QT syndromes. The relation between mutations their clinical phenotypes is complex, systems to predict severity unclassified variants perform poorly. We investigated if instead we could changes , leaving link from phenotype for mechanistic simulation studies. An exhaustive list nonsynonymous missense resulting was compiled. then applied machine-learning...
We present a method for finding symbolic dynamics planar diffeomorphism with homoclinic tangle. The only requires finite piece of tangle, which can be computed available numerical techniques. symbol space is naturally given by components the complement stable and unstable manifolds. shift map defining factor subshift type, obtained from graph related to entropy this lower bound topological diffeomorphism. give examples arising Hénon family.
Shadowing is a method of backward error analysis that plays important role in hyperbolic dynamics. In this paper, the shadowing by containment framework revisited, including new theorem. This theorem has several advantages with respect to existing theorems: It does not require injectivity or differentiability, and its hypothesis can be easily verified using interval arithmetic. As an application theorem, shown applicable infinite length orbits used provide computer assisted proof presence...
If <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper W left-parenthesis x right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>W</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">W(x)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> (for each alttext="x element-of upper X"> <mml:mo>∈<!-- ∈ --></mml:mo>...
We propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with denotational semantics, ERC provides formal language-theoretic foundation to the algorithmic processing of numbers. In order capture multi-valuedness, which is well-known be essential number computation, we use Plotkin powerdomain and make our language semantics computable complete: all only functions in analysis can realized ERC. The base supports...
Abstract We show how to obtain information about the dynamics of a two-dimensional discrete-time system from its homoclinic and heteroclinic orbits. The results obtained are based on theory 'trellises', which comprise finite-length subsets stable unstable manifolds collection saddle periodic For any or orbits, we associate canonical 'trellis type' describes Given trellis type, compute 'graph representative' gives combinatorial invariant type. orbits graph give forced by...
An important problem in the dynamics of surface homeomorphisms is determining forcing relation between orbits. The periodic orbits can be computed using existing algorithms. Here we consider relations homoclinic We outline a general procedure for computing and apply this to compute equivalence Smale horseshoe map.
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use framework type-two effectivity, in which computations are performed by Turing machines with infinite input output tapes, representations computable topology. see that reachable set is lower-semicomputable, viability invariance kernels upper-semicomputable. then define an upper-semicomputable over-approximation to set, lower-semicomputable under-approximations kernels, show...
One tool to analyze the qualitative behavior of a periodic orbit vector field in $\mathbb{R}^n$ is consider Poincaré return map an $(n-1)$-dimensional section. The image under point on this section that lies near obtained by following flow until next (local) intersection. It well known defined transverse diffeomorphism locally orbit. However, practice one often considers not only but also much larger global and typically unbounded Generically, there are then points where tangent section,...