Проектування та модельне обґрунтування застосувань на основі відеоадаптерів

Досліджено модельне обгрунтування властивостей архітектур відеоадаптерів виробництва NVIDIA. Розглянуто послідовність застосування апарату транзиційних систем для побудови високорівневої специфікації та апарату мереж Петрі для верифікації моделі застосування. Проведено формалізацію узагальненої моделі обчислень в архітектурі NVIDIA CUDA та досліджено її на предмет наявності дедлоків, пасток, властивості обмеженості та відсутності мертвих місць і переходів.Цель. Презентация нового метода создания приложений с использованием видеоадаптеров, основанного на модельном проектировании. Результат. С помощью аппарата транзицийних систем удалось получить формализованную спецификацию анализируемой системы. Благодаря ее представлению сетью Петри проведен анализ модели на наличие дедлоков и ловушек, а также на отсутствие мертвых переходов и мест. Получены множества базисных и минимальных дедлоков и ловушек, показано, что каждый дедлок включает в себя по меньшей мере одну из ловушек, то есть полученная модель является живой.Purpose. The purpose of this article is to present the new method of GPU-based application development based on the model design. Result. A formalized specification of the analyzed system could be obtained due to the transi-tion system apparatus usage. The model is analyzed for the deadlocks (siphons) and traps and the absence of dead transitions and places. The sets of basis and minimum deadlocks and traps are obtained. Model aliveness is proved due to the fact that each deadlock includes at least one of the traps

Ontology View on Automata Theory

The summary of automata theory ontology is presented in the paper. It is based on the following dependences: a type of an automaton – the language accepted by the automaton – applications. The given ontology does not claim to be exhaustive as automata theory is very extensive and it is a complicated problem to survey all its aspects within one article. Only the main properties of automata and their applications are considered

开放式自动机同步网络的互模拟理论

International audience本文为分布式语言提出一个表达能力较强的模型-同步自动机的参数化网络。 通过定义开放式自动机给出了此模型的行为语义, 并在此基础上给出了一种特殊的等价关系--规范假设互模拟等价。 我们讨论了这种等价关系在规范假设条件下的可复合性和可判定性

Communication requirements for team automata

Compatibility of components is an important issue in the quest for systems of systems that guarantee successful communications, free from message loss and indefinite waiting for inputs. In this paper, we investigate compatibility in the context of systems consisting of reactive components which may communicate through the synchronised execution of common actions. We model such systems in the team automata framework, which does not impose any a priori restrictions on the synchronisation policy followed to combine the components. We identify a family of representative synchronisation types based on the number of sending and receiving components participating in synchronisations. Then, we provide a generic procedure to derive, for each synchronisation type, requirements for receptiveness and for responsiveness of team automata that prevent that outputs are not accepted and inputs are not provided, respectively. Due to the genericity of our approach w.r.t. synchronisation policies, we can capture compatibility notions for various multi-component system models known from the literature.Peer ReviewedPostprint (author's final draft

Automatic deployment of autonomous cars in a robotic urban-like environment

Abstract-We present a computational framework and experimental setup for deployment of autonomous cars in a miniature Robotic Urban-Like Environment (RULE). The specifications are given in rich, human-like language as temporal logic statements about roads, intersections, and parking spaces. We use transition systems to model the motion and sensing capabilities of the robots and the topology of the environment and use tools resembling model checking to generate robot control strategies and to verify the correctness of the solution. The experimental setup is based on Khepera III robots, which move autonomously on streets while observing traffic rules

Method of semantic application verification in gpgpu technology

An application development and verification method for massively parallel systems using NVIDIA GPUs is proposed. The method allows creating models at different levels of abstraction using the apparatus of marked transition systems. The compositions (product) of such systems are transformed into a Petri net, which are then analyzed by appropriate means. The proposed method allows specifying model properties by temporal logic formulas. This allows studying the properties of massively parallel systems which is almost impossible to analyze manually, since the number of execution threads in the latest NVIDIA video adapter architectures (Pascal, Volta, Turing, Ampere) is measured in hundreds of thousands or millions

Towards a verified transformation from AADL to the formal component-based language FIACRE

International audienceDuring the last decade, aadl  is an emerging architecture description languages addressing the modeling of embedded systems. Several research projects have shown that aadl  concepts are well suited to the design of embedded systems. Moreover, aadl  has a precise execution model which has proved to be one key feature for effective early analysis. In this paper, we are concerned with the foundational aspects of the verification support for aadl. More precisely, we propose a verification toolchain for aadl  models through its transformation to the Fiacre language which is the pivot verification language of the TOPCASED project: high level models can be transformed to Fiacre  models and then model-checked. Then, we investigate how to prove the correctness of the transformation from AADL into Fiacre and present related elementary ingredients: the semantics of aadl  and Fiacre  subsets expressed in a common framework, namely timed transition systems. We also briefly discuss experimental validation of the work

From AADL to Timed Abstract State Machines: A Verified Model Transformation

International audienceArchitecture Analysis and Design Language (AADL) is an architecture description language standard for embedded real-time systems widely used in the avionics and aerospace industry to model safety-critical applications. To verify and analyze the AADL models, model transformation technologies are often used to automatically extract a formal specification suitable for analysis and verification. In this process, it remains a challenge to prove that the model transformation preserves the semantics of the initial AADL model or, at least, some of the specific properties or requirements it needs to satisfy. This paper presents a machine checked semantics-preserving transformation of a subset of AADL (including periodic threads, data port communications, mode changes, and the AADL behavior annex) into Timed Abstract State Machines (TASM). The AADL standard itself lacks at present a formal semantics to make this translation validation possible. Our contribution is to bridge this gap by providing two formal semantics for the subset of AADL. The execution semantics provided by the AADL standard is formalized as Timed Transition Systems (TTS). This formalization gives a reference expression of AADL semantics which can be compared with the TASM-based translation (for verification purpose). Finally, the verified transformation is mechanized in the theorem prover Coq