Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: finite

Sortuj według:

Ogranicz wyniki do:

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

Bruse Florian, Lange Martin, Lozes Etienne

Fundamenta Informaticae

2021

Vol. 178, nr 1/2

1--30

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ -calculus into the modal μ -calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k -EXPTIME-complete for formulas that use functions of type order at most k > 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

Multivariate calculations of the electrodynamic linear accelerator with a permanent magnet support

Waindok Andrzej, Tomczuk Bronisław, Piekielny Paweł

Journal of Theoretical and Applied Mechanics

2020

Vol. 58 nr 3

733--741

Multivariate calculations of the electrodynamic accelerator with a permanent magnet support and a ferromagnetic core are presented in the paper. The calculations were made with using the Magnetostatic module of Maxwell/ANSYS software. The purpose of these calculations was to determine the size and location of permanent magnets in terms of maximizing the force acting on the projectile. In the presented paper, three cases have been analyzed. In order to perform a comparative analysis of the obtained results of calculations, dimensions of the rails, projectile and outer dimensions of the core were kept constant.