检索结果-内蒙古大学图书馆

11th Brazilian Conference on Intelligent Systems (BRACIS)

作者： Souza, Mario Univ Fed Bahia Salvador BA Brazil

ISBN: (纸本)9783031216855;9783031216862

Computation tree logic is a temporal logic proposed as a tool for formal design and verification of concurrent systems in which execution flows may have many possible branches. A specification of a concurrent system may thus be constructed using a relational model for this logic, and the formal verification of the system's properties may be carried out through model checking. While CTL has obtained a great deal of success as a specification tool, there was a lack of systematic processes for reasoning about the revision and evolution of such specifications. Recently, some literature has proposed applying Belief Change techniques to the problem of revising CTL theories, with implications for revision of formal specifications of systems. This work expands this idea by proposing a Temporal Preference logic, a multimodal logic with which we can reason about Belief Change in CTL. We show general results regarding the expressivity and decidability of some AGM Belief Revision operators for CTL.

关键词： Belief revision computational tree logic Preference logic

来源：评论

学校读者我要写书评

暂无评论

Methodology for Integrating computational tree logic Model Checking in Unified Modelling Language Artefacts: A Case Study of an Embedded Controller

引用

DEFENCE SCIENCE JOURNAL 2019年第1期69卷 58-64页

作者： Kochaleema, K. H. Santhoshkumar, G. DRDO Naval Phys & Oceanog Lab Kochi 682021 Kerala India Cochin Univ Sci & Technol Fac Technol Kochi 682022 Kerala India

A unified modelling language (UML) based formal verification methodology that can be easily integrated into an embedded system software development life cycle is suggested. The approach augments UML diagrams with formal models through an interfacing domain and adds semantics to these diagrams. The suggested methodology;commences from functional specification and use case modelling, selects the most critical behaviour where formal verification can add value to the development cycle, analyses the selected behaviour using UML state transition diagram, derives a state chart matrix from the same, and a high level language software translates the state chart matrix to a labelled transition system. Safety properties are derived from system specifications and are expressed as computation tree logic (CTL) formulae. CTL model-checking algorithm from the literature is used for model-checking. The applicability of the suggested approach is established using a safety critical embedded controller used for deployment and recovery of sensor structures from an airborne platform.

关键词： Unified modelling language State chart diagram State chart matrix Safety property specification computational tree logic Formal verification

来源：评论

学校读者我要写书评

暂无评论

D³NN: Data-Driven Dual-level Neural Network Tool for Dynamical System Modeling and Abstraction 8

D<SUP>3</SUP>NN: Data-Driven Dual-level Neural Network Tool ...

引用

8th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS)

作者： Yang, Yejiang Mo, Zihao Xiang, Weiming Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA Southwest Jiaotong Univ Sch Elect Engn Chengdu Peoples R China

This paper presents (DNN)-N-3, a neural network learning tool for dual-level dynamic system modeling. This tool aims to model the dynamic system under a dual-level modeling framework, i.e., modeling the system dynamics through a computationally efficient and precise low-level neural hybrid system and an interpretable high-level transition system abstraction. Given samples of the dynamic system and user specifications, the proposed tool can generate a low-level distributive learning framework consisting of shallow neural network approximations for local dynamics and its high-level transition system abstraction that allows computational tree logic (CTL) formulae verification. Copyright (c) 2024 The Authors. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0/)

关键词： Hybrid System Transition System Neural Networks computational tree logic

来源：评论

学校读者我要写书评

暂无评论

Generic Methodology for Formal Verification of UML Models

引用

DEFENCE SCIENCE JOURNAL 2022年第1期72卷 40-48页

作者： Kochaleema, K. H. Kumar, G. Santhosh Cochin Univ Sci & Technol Kochi 682022 Kerala India DRDO Naval Phys & Oceanog Lab Kochi 682021 Kerala India

This paper discusses a Unified Modelling Language (UML) based formal verification methodology for early error detection in the model-based software development cycle. Our approach proposes a UML-based formal verification process utilising functional and behavioural modelling artifacts of UML. It reinforces these artifacts with formal model transition and property verification. The main contribution is a UML to Labelled Transition System (LTS) Translator application that automatically converts UML Statecharts to formal models. Property specifications are derived from system requirements and corresponding computational tree logic (CTL)/Linear Temporal logic (LTL) model checking procedure verifies property entailment in LTS. With its ability to verify CTL and LTL specifications, the methodology becomes generic for verifying all types of embedded system behaviours. The steep learning curve associated with formal methods is avoided through the automatic formal model generation and thus reduces the reluctance of using formal methods in software development projects. A case study of an embedded controller used in military applications validates the methodology. It establishes how the methodology finds its use in verifying the correctness and consistency of UML models before implementation.

关键词： Formal verification computational tree logic Linear temporal logic Property specification State chart diagram UML modelling

来源：评论

学校读者我要写书评

暂无评论

D 3 NN: Data-Driven Dual-level Neural Network Tool for Dynamical System Modeling and Abstraction ⁎

引用

IFAC-PapersOnLine 2024年第11期58卷 7-12页

作者： Yejiang Yang Zihao Mo Weiming Xiang School of Computer and Cyber Sciences Augusta University Augusta GA 30912 USA School of Electrical Engineering Southwest Jiaotong University Chengdu China

This paper presents D 3 NN, a neural network learning tool for dual-level dynamic system modeling. This tool aims to model the dynamic system under a dual-level modeling framework, i.e., modeling the system dynamics through a computationally efficient and precise low-level neural hybrid system and an interpretable high-level transition system abstraction. Given samples of the dynamic system and user specifications, the proposed tool can generate a low-level distributive learning framework consisting of shallow neural network approximations for local dynamics and its high-level transition system abstraction that allows computational tree logic (CTL) formulae verification.

关键词： Hybrid System Transition System Neural Networks computational tree logic

来源：评论

学校读者我要写书评

暂无评论

A Novel GAPG Approach to Automatic Property Generation for Formal Verification: The GAN Perspective

引用

ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS 2023年第1期19卷 16-16页

作者： Gao, Honghao Dai, Baobin Miao, Huaikou Yang, Xiaoxian Barroso, Ramon J. Duran Walayat, Hussain Shanghai Univ Sch Comp Engn & Sci Shanghai 200444 Peoples R China Shanghai Polytech Univ Sch Comp & Informat Engn Shanghai 201209 Peoples R China Univ Valladolid Fac Telecommun Engn Valladolid 47002 Spain Univ Technol Sydney Fac Engn & IT Sydney NSW 2007 Australia

Formal methods have been widely used to support software testing to guarantee correctness and reliability. For example, model checking technology attempts to ensure that the verification property of a specific formal model is satisfactory for discovering bugs or abnormal behavior from the perspective of temporal logic. However, because automatic approaches are lacking, a software developer/tester must manually specify verification properties. A generative adversarial network (GAN) learns features from input training data and outputs new data with similar or coincident features. GANs have been successfully used in the image processing and text processing fields and achieved interesting and automatic results. Inspired by the power of GANs, in this article, we propose a GAN-based automatic property generation (GAPG) approach to generate verification properties supporting model checking. First, the verification properties in the form of computational tree logic (CTL) are encoded and used as input to the GAN. Second, we introduce regular expressions as grammar rules to check the correctness of the generated properties. These rules work to detect and filter meaningless properties that occur because the GAN learning process is uncontrollable and may generate unsuitable properties in real applications. Third, the learning network is further trained by using labeled information associated with the input properties. These are intended to guide the training process to generate additional new properties, particularly those that map to corresponding formal models. Finally, a series of comprehensive experiments demonstrate that the proposed GAPG method can obtain new verification properties from two aspects: (1) using only CTL formulas and (2) using CTL formulas combined with Kripke structures.

关键词： Model checking verification property generative adversarial network (GAN) automatic property generation computational tree logic correctness and reliability

来源：评论

学校读者我要写书评

暂无评论

Towards the Formalization of Contradictions in a Legal Multiagent System 13

Towards the Formalization of Contradictions in a Legal Multi...

引用

13th International Symposium on Intelligent Systems (INTELS)

作者： Novikova, G. M. Azofeifa, E. J. Milov, V. R. RUDN Univ Miklukho Maklaya Str 6 Moscow 117198 Russia Nizhnii Novgorod State Tech Univ Minin St 24 Nizhnii Novgorod 603950 Russia

As existing legal systems expand and become more complex, the search of effective ways to model them becomes increasingly important in the area of computational Law. We chose normative multiagent systems (NMAS) to study the interaction between a legal framework, a set of agents and the fundamental theories that regulate the legal dynamics of a society. Using this approach in conjunction with computational tree logic (CTL), we determined that there is an increasing possibility of encountering contradictions inside complex legal systems, which in turn could undermine their purposes. We consider that contradictions are the fundamental units to take into account when diagnosing a legal system, and we classify them into several kinds according to the system structure they affect. Finally, we point to the direction of research needed for the development of intelligent agents capable of targeting contradictions. (C) 2019 The Authors. Published by Elsevier B.V.

关键词： multiagent normative computational tree logic computational law legal contradictions intelligent agent logical context

来源：评论

学校读者我要写书评

暂无评论

An Approximate CTL Model Checking Approach 10

An Approximate CTL Model Checking Approach

引用

10th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Zhu, Weijun Feng, Pan Deng, Miaolei Zhengzhou Univ Sch Informat Engn Zhengzhou 450001 Henan Peoples R China Henan Univ Technol Sch Informat Sci & Engn Zhengzhou 450001 Henan Peoples R China

ISBN: (纸本)9781728109459

The state space explosion is the main bottleneck of computational tree logic (CTL) model checking. In the framework of traditional model checking technique, this problem is difficult to be solved completely. To this end, a method is proposed for predicting the results for CTL model checking using several Machine Learning (ML) algorithms. First, the data set with a number of Kripke structures, CTL formulas and their model checking results are obtained, using the existing CTL model checking tool. Second, Random Forest (RF), Boosted trees (BT), Decision trees (DT) and Logistic Regression (LR) algorithms are employed to train the data set. On the basis of it, the four ML models are obtained to predict the results of CTL model checking. The experiments show that the best accuracy of the new method is same as the existing CTL model checking methods, and its average efficiency is 378 times higher than that of the existing method, if the length of each of CTL formulas equals to 500.

关键词： machine learning model checking computational tree logic kripke structure

来源：评论

学校读者我要写书评

暂无评论

CTL Model Checking based on Probe Machine 10

CTL Model Checking based on Probe Machine

引用

10th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Zhu, Weijun Liu, Yichen Li, En Zhengzhou Univ Sch Informat Engn Zhengzhou 450001 Henan Peoples R China Zhengzhou Univ Affiliated Hosp 2 Zhengzhou 450003 Henan Peoples R China

ISBN: (纸本)9781728109459

How to use a probe machine to model checking the computational tree logic (CTL) formulas? This problem is still pending. To this end, a novel DNA algorithm based on probe machine is designed and pioneered. First, a pool containing probes and some data fibers are constructed. Second, specific hybridizations are used to connect the probes to the data fibers. At last, based on the given judging conditions, the model checking results for the different basic CTL formulas are obtained. The simulated experiments have demonstrated the effectiveness of the new method.

关键词： probe machine computational tree logic model checking

来源：评论

学校读者我要写书评

暂无评论

Towards the Formalization of Contradictions in a Legal Multiagent System

引用

Procedia Computer Science 2019年 150卷 488-494页

作者： G.M. Novikova E.J. Azofeifa V.R. Milov RUDN University Miklukho-Maklaya str. 6 Moscow 117198 Russia Nizhny Novgorod State Technical University n.a. R.E. Alekseev Minin St. 24 Nizhny Novgorod 603950 Russia

关键词： multiagent normative computational tree logic computational law legal contradictions intelligent agent logical context

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：