Results 1 to 10 of about 1,172 (171)
Aspect-oriented linearizability proofs [PDF]
Logical Methods in Computer Science, 2015 Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale
Soham Chakraborty +3 more
doaj +7 more sources
Linearizability with Ownership Transfer [PDF]
Logical Methods in Computer Science, 2013 Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and its client, with interactions limited to passing values of a given data type.
Alexey Gotsman, Hongseok Yang
doaj +6 more sources
Linearization of discrete-time control system by state transformation [PDF]
Proceedings of the Estonian Academy of Sciences, 2021 This paper presents necessary and sufficient linearizability conditions by state transformation for discrete-time multi-input nonlinear control system under the mild assumption on the surjectivity property and describes how to find the state ...
Tanel Mullari, Ülle Kotta
doaj +1 more source
Modularising Verification Of Durable Opacity [PDF]
Logical Methods in Computer Science, 2022 Non-volatile memory (NVM), also known as persistent memory, is an emerging paradigm for memory that preserves its contents even after power loss. NVM is widely expected to become ubiquitous, and hardware architectures are already providing support for ...
Eleni Bila +5 more
doaj +1 more source
Limit Cycles and Integrability of a Class of Quintic System
Mathematics, 2022 In this paper, a class of quintic systems is investigated. The first 13 focal values are computed with the aid of MATHEMATICA. Then the necessary conditions of integrability and linearizability are obtained and the sufficiency of every condition is ...
Yanli Tang, Dongmei Zhang, Feng Li
doaj +1 more source
Static state feedback linearizability: relationship between two methods; pp. 121–135 [PDF]
Proceedings of the Estonian Academy of Sciences, 2011 The paper establishes the explicit relationship between two sets of necessary and sufficient conditions for static state feedback linearizability of a discrete-time nonlinear control system.
Tanel Mullari, Ülle Kotta, Maris Tõnso
doaj +1 more source
Nontrivial Isometric Embeddings for Flat Spaces
Universe, 2021 Nontrivial isometric embeddings for flat metrics (i.e., those which are not just planes in the ambient space) can serve as useful tools in the description of gravity in the embedding gravity approach.
Sergey Paston, Taisiia Zaitseva
doaj +1 more source
Feedback linearization of discrete-time nonlinear control systems: computational aspects [PDF]
Proceedings of the Estonian Academy of Sciences, 2020 An alternative solution of the static state feedback linearization problem for the discrete-time case is given. This solution is based on the sequence of distributions, whose computation requires only the knowledge of the backward shift equations.
Tanel Mullari, Ülle Kotta
doaj +1 more source
The The 1:-1:1 Resonance Integrable Problem for a Cubic Lotka-Volterra Systems.
Zanco Journal of Pure and Applied Sciences, 2019 This paper is devoted to investigate the integrability and linearizability problems around a singular point at the origin of a cubic three-dimensional Lotka-Volterra differential system with -resonance.
Hersh Mohammed Saber, Waleed H. Aziz
doaj +1 more source
Linearizability Problem of Resonant Degenerate Singular Point for Polynomial Differential Systems
Journal of Applied Mathematics, 2012 The linearizability (or isochronicity) problem is one of the open problems for polynomial differential systems which is far to be solved in general. A progressive way to find necessary conditions for linearizability is to compute period constants.
Yusen Wu, Cui Zhang, Luju Liu
doaj +1 more source