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

parallel model checking Large-Scale Genetic Regulatory Networks with DiVinE

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2008年第3期194卷 35-50页

作者： Barnat, J. Brim, L. Cerna, I. Drazan, S. Safranek, D. Masaryk Univ Fac Informat Brno Czech Republic

Studies of cells in silico can greatly reduce the need for expensive and prolonged laboratory experimentation. The use of model checking for the analysis of biological networks has attracted much attention recently. One of the practical limitations is the size of the model. In the paper we report on parallel model checking of genetic regulatory network using the model-checker DiVinE. The approach can check linear time properties on large networks.

关键词： genetic regulatory networks discrete simulation parallel model checking

来源：评论

学校读者我要写书评

暂无评论

On Parameter Synthesis by parallel model checking

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2012年第3期9卷 693-705页

作者： Barnat, Jiri Brim, Lubos Krejci, Adam Streck, Adam Safranek, David Vejnar, Martin Vejpustek, Tomas Masaryk Univ Fac Informat Brno 60200 Czech Republic

An important problem in current computational systems biology is to analyze models of biological systems dynamics under parameter uncertainty. This paper presents a novel algorithm for parameter synthesis based on parallel model checking. The algorithm is conceptually universal with respect to the modeling approach employed. We introduce the algorithm, show its scalability, and examine its applicability on several biological models.

关键词： Biological networks parallel model checking dynamical systems parameter synthesis systems biology

来源：评论

学校读者我要写书评

暂无评论

Designing fast LTL model checking algorithms for many-core GPUs

引用

JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2012年第9期72卷 1083-1097页

作者： Barnat, Jiri Bauch, Petr Brim, Lubos Ceska, Milan Masaryk Univ Fac Informat Brno 60200 Czech Republic

Recent technological developments made various many-core hardware platforms widely accessible. These massively parallel architectures have been used to significantly accelerate many computation demanding tasks. In this paper, we show how the algorithms for LTL model checking can be redesigned in order to accelerate LTL model checking on many-core CPU platforms. Our detailed experimental evaluation demonstrates that using the NVIDIA CUDA technology results in a significant speedup of the verification process. Together with state space generation based on shared hash-table and DFS exploration, our CUDA accelerated model checker is the fastest among state-of-the-art shared memory model checking tools. The effective utilization of the CUDA technology, however, is quite often reduced by the costly preparation of suitable data structures and limited to small or middle-sized instances due to space limitations, which is also the case of our CUDA-aware LTL model checking solutions. Hence, we further suggest how to overcome these limitations by multi-core construction of the compact data structures and by employing multiple CUDA devices for acceleration of fine-grained communication-intensive parallel algorithms for LTL model checking. (C) 2011 Elsevier Inc. All rights reserved.

关键词： parallel model checking Linear temporal logic Massively parallel architectures CUDA technology Multiple CUDA devices

来源：评论

学校读者我要写书评

暂无评论

A Case Study in parallel Verification of Component-Based Systems

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2008年第2期220卷 67-83页

作者： Benes, N. Cerna, I. Sochor, J. Varekova, P. Zimmerova, B. Masaryk Univ Brno Fac Informat Brno Czech Republic

In large component-based systems, the applicability of formal verification techniques to check interaction correctness among components is becoming challenging due to the concurrency of a large number of components. In our approach, we employ parallel LTL-like model checking to handle the size of the model. We present the results of the actual application of the technique to the verification of a complex model of a real system created within the CoCoME modelling Contest [18]. In this case study, we check the validity of the model and the correctness of the system via checking various temporal properties. We concentrate on the component-specific properties, like local deadlocks of components, and correctness of given use-case scenarios.

关键词： Component-based systems formal verification parallel model checking

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of Sequence Diagram using DiVinE

Formal Verification of Sequence Diagram using DiVinE

引用

World Congress on Computer Applications and Information Systems (WCCAIS)

作者： Basit-Ur-Rahim, Muhammad Abdul Arif, Fahim Ahmad, Jamil Natl Univ Sci & Technol Mil Coll Signals Rawalpindi Pakistan Natl Univ Sci & Technol Res Ctr Modeling & Simulat Islamabad Pakistan

ISBN: (纸本)9781479933518

System modeling language is used to model the system engineering applications. This graphical modeling language is a semi-formal language. To develop a reliable application, the graphical models for large scale critical and complex applications must be validated and verified against user requirements in earlier phase of system development cycles. The sequence diagram is one of the popular diagram of SysML. The fragments of sequence diagram increase its functionality but the complexity as well. In this paper, a methodology is proposed to verify the sequence diagram including its fragments. The verification is performed using DiVinE parallel model checking tool that not only accelerates verification speed but also save modeling and verification cost. The rules have been specified to translate these individual fragments to DiVinE's supported language DVE. To develop a reliable product, our results suggest the use of DiVinE for verification of sequence diagram including its fragments.

关键词： component Verification and validation parallel model checking DiVinE Sequence Diagram SysML

来源：评论

学校读者我要写书评

暂无评论

SOG-Based Multi-Core LTL model checking 18

SOG-Based Multi-Core LTL Model Checking

引用

18th IEEE Int Symp on parallel and Distributed Proc with Applicat (ISPA) / 10th IEEE Int Conf on Big Data and Cloud Comp (BDCloud) / IEEE Int Symp on Social Comp and Networking (SocialCom) / IEEE Int Conf on Sustainable Comp and Commun (SustainCom)

作者： Abid, Chiheb Ameur Klai, Kais Arias, Jaime Ouni, Hiba Univ Carthage Tunis SupCom Mediatron Lab Tunis Tunisia Univ Sorbonne Paris North CNRS UMR 7030 LIPN Villetaneuse France

ISBN: (纸本)9781665414852

The model checking is one of the major techniques used in the formal verification. This technique builds on an automatic procedure that takes a model M of a system and a formula phi expressing a temporal property, and decides whether the system satisfies the property (denoted by M satisfies phi). The model checking technique is based on an exhaustive exploration of the state space of the system and, thus suffers from the state space explosion problem: it can happen that the verification process stops because of lack of time or space. Among the existing solutions to tackle this problem the Symbolic Observation Graph (SOG) has been proposed as a reduced representation of the reachability graph preserving linear temporal logic properties (LTL) i.e. checking an LTL property on the SOG is equivalent to check it on the original state space. The parallel construction of the SOG could increase the speedup and scalability of model checking. In this paper, we propose a new model checking algorithm built on a parallel construction of the SOG. The SOG is adapted to allow the preservation of both state and event-based LTL formulae i.e., the atomic propositions involved in the formula to be checked could be either state-based or event-based propositions. We implemented the proposed model checking algorithm within a C++ prototype and compared our preliminary results with the state of the art model checkers.

关键词： parallel model checking Temporal Logic Decision Diagrams

来源：评论

学校读者我要写书评

暂无评论

parallel Symbolic Observation Graph 15

Parallel Symbolic Observation Graph

引用

15th IEEE International Symposium on parallel and Distributed Processing with Applications (ISPA) / 16th IEEE International Conference on Ubiquitous Computing and Communications (IUCC)

作者： Ouni, Hiba Klai, Kais Abid, Chiheb Ameur Zouari, Belhassen Univ Tunis El Manar Fac Sci Tunis Tunis 2092 Tunisia Univ Carthage Higher Sch Commun Tunis Mediatron Lab Tunis Tunisia Univ Paris 13 Sorbonne Paris Cite CNRS UMR 7030 LIPN Villetaneuse France

ISBN: (纸本)9781538637906

model checking is a powerful technique for verifying and analyzing complex systems in many application fields. The analysis process of complex and concurrent systems often requires large computation resources which represents a real challenge. Even with simple configurations, the well-known state explosion problem is faced as the generated state space of such systems grows exponentially with the number of the system components. Numerous methods and techniques have been developed to overcome this problem including parallel and distributed-memory processing. In this paper, we aim at improving the performances of the so called Symbolic Observation Graph (SOG) construction by using parallelization techniques. A SOG is a hybrid structure where the transitions of a system are divided into observed and unobserved ones. The nodes of this graph are then defined as sets of states linked with unobserved transitions (and encoded symbolically with a BDD) and edges are labeled with observed transitions only (and are explicitly represented). We propose two parallel algorithms to build the SOG. The first algorithm is dedicated for shared memory architectures, and is based on the distribution of the SOG construction on several threads using a dynamic load balancing scheme. The second algorithm is proposed for distributed memory architectures, and distributes the SOG construction on processes using a static load balancing scheme. These two algorithms are implemented and their performances are studied and compared to each other and to the sequential construction of the SOG.

关键词： Distributed memory Multi threading parallel model checking Symbolic reachability

来源：评论

学校读者我要写书评

暂无评论

Computational Analysis of Large-Scale Multi-Affine ODE models

Computational Analysis of Large-Scale Multi-Affine ODE Model...

引用

International Workshop on High Performance Computational Systems Biology (HiBi 2009)

作者： Barnat, J. Brim, L. Cerna, I. Drazan, S. Fabrikova, J. Safranek, D. Masaryk Univ Fac Informat Brno Czech Republic

ISBN: (纸本)9780769538099

A biological system as considered in systems biology is understood in the form of a network of interactions among individual biochemical species. Complexity of these networks is inherently enormous, even for simple (e.g... procaryotic) organisms. When modeling and analyzing dynamics of these networks, i.e., exploring how the species evolve in time, we have to fight even another level of complexity - the enormous state space. In this paper we deal with a class of biological models that call be described in terms of multi-affine dynamic systems. First, we present a prototype tool for parallel (distributed) analysis of multi-affine systems discretized into rectangles that adapts the approach of Belta ***. [1], [2]. Secondly, we propose heuristics that significantly increase applicability of the approach to large biological models. Effects of different settings of the heuristics is firstly compared on a set of experiments performed on small models. Subsequently, experiments on large models are provided as well.

关键词： biological networks parallel model checking dynamic systems rectangular abstraction

来源：评论

学校读者我要写书评

暂无评论

Reducing Time and/or Memory Consumption of The SOG construction in a parallel Context 16

Reducing Time and/or Memory Consumption of The SOG construct...

引用

16th IEEE ISPA / 17th IEEE IUCC / 8th IEEE BDCloud / 11th IEEE SocialCom / 8th IEEE SustainCom

作者： Ouni, Hiba Klai, Kais Abid, Chiheb Ameur Zouari, Belhassen Univ Tunis El Manar Fac Sci Tunis Tunis 2092 Tunisia Univ Paris 13 CNRS UMR 7030 LIPNSorbonne Paris Cite Villetaneuse France Univ Carthage Higher Sch Commun Tunis Mediatron Lab Tunis Tunisia

ISBN: (纸本)9781728111414

An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Such a graph is a condensed representation of the state space that is obtained by taking advantage of symbolic representation of the nodes. Each node, called aggregate, represents a set of explicit states and is encoded using Multi-valued decision diagrams. In a previous work, we have shown that parallel and distributed approaches can improve drastically the performances of the SOG computation regarding a sequential construction. In this paper, we go a step forward in improving the SOG construction process by reducing, on the fly, the size of its aggregates. We propose a Multi-valued decision diagrams (MDDs) based algorithm to determine a single representative for each strongly connected component in every aggregate allowing to remove from memory a consequent number of states which are no more necessary for the construction process. Two parallel approaches for the building of an SOG are proposed using such an optimization. The first approach is based on a shared memory architecture, while the second is based on a distributed memory one. The results of our preliminary experiments show that, in first case, the canonization allows to obtain more compact SOG (in terms of memory consumption) while increasing the computation time. However, for the distributed memory based approach, the canonization allows to reduce the size of exchanged messages and therefore reducing communication time.

关键词： Canonization Distributed model checking parallel model checking

来源：评论

学校读者我要写书评

暂无评论

Towards Informed Swarm Verification

Towards Informed Swarm Verification

引用

3rd NASA Formal Methods Symposium

作者： Wijs, Anton Eindhoven Univ Technol NL-5612 AZ Eindhoven Netherlands

ISBN: (纸本)9783642203978

In this paper, we propose a new method to perform large scale grid model checking. A manager distributes the workload over many embarrassingly parallel jobs. Only little communication is needed between a worker and the manager, and only once the worker is ready for more work. The novelty here is that the individual jobs together form a so-called cumulatively exhaustive set, meaning that even though each job explores only a part of the state space, together, the tasks explore all states reachable from the initial state.

关键词： parallel model checking state space exploration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：