Results 61 to 70 of about 17,250 (168)
Journal of Mathematics, Volume 2025, Issue 1, 2025.Robotics systems deal with uncertainties and nonlinearities of robot manipulator dynamics, such as the mass of the payload, which is an unmodeled dynamic uncertainty, and external disturbances caused by fluctuations from external sources. Hence, it has huge industrial applications.
Irfan Ali +4 more
wiley +1 more source
Representation of the program model using predicates
Радіоелектронні і комп'ютерні системиThe object of research in this article is the process of modeling programs and their subsequent development. The purpose of this article is to develop a methodology for describing and building software models in the form of nondeterministic finite ...
Serhii Holub +2 more
doaj +1 more source
Coalgebraic Infinite Traces and Kleisli Simulations
, 2018 Kleisli simulation is a categorical notion introduced by Hasuo to verify finite trace inclusion. They allow us to give definitions of forward and backward simulation for various types of systems. A generic categorical theory behind Kleisli simulation has
Hasuo, Ichiro, Urabe, Natsuki
core +1 more source
An efficient static solver for the lattice discrete particle model
Computer-Aided Civil and Infrastructure Engineering, Volume 39, Issue 23, Page 3531-3551, 1 December 2024.Abstract The lattice discrete particle model (LDPM) has been proven to be one of the most appealing computational tools to simulate fracture in quasi‐brittle materials. Despite tremendous advancements in the definition and implementation of the method, solution strategies are still limited to dynamic algorithms, resulting in prohibitive computational ...
Dongge Jia +2 more
wiley +1 more source
Searching long patterns with BNDM
Software: Practice and Experience, Volume 54, Issue 11, Page 2160-2169, November 2024.Abstract We present new algorithms for exact string matching of long patterns. Our algorithms read q$$ q $$‐grams at constant distances and are variations of the simplified BNDM algorithm. We demonstrate the competitiveness of our solutions through practical experiments.
Jorma Tarhio
wiley +1 more source
IET Control Theory &Applications, Volume 18, Issue 17, Page 2307-2321, November 2024.Fault diagnosis and diagnosability enforcement are critical for the development and operation of highly automated systems. This work touches upon this problem from the perspective of discrete event systems that are modeled with labeled Petri nets. The sufficient and necessary conditions of diagnosability enforcement can be readily verified by the ...
Shaopeng Hu +4 more
wiley +1 more source
Can Nondeterminism Help Complementation?
, 2012 Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Aniello Murano +26 more
core +2 more sources
On finitely ambiguous B\"uchi automata
, 2018 Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking.
A Arnold +14 more
core +1 more source
, 2015 This paper studies the problem of model-checking of probabilistic automaton and probabilistic one-counter automata against probabilistic branching-time temporal logics (PCTL and PCTL$^*$). We show that it is undecidable for these problems.
Lin, T.
core
Attack-Resilient Supervisory Control of Discrete-Event Systems
, 2020 In this work, we study the problem of supervisory control of discrete-event systems (DES) in the presence of attacks that tamper with inputs and outputs of the plant.
Bozkurt, Alper Kamil +2 more
core