Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 33 )

2018 ( 138 )

2017 ( 155 )

2016 ( 154 )

Custom range...

Search Results: 1 - 10 of 15472 matches for " Ji?í Barnat "
All listed articles are free for downloading (OA Articles)
Page 1 /15472
Display every page Item
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
Lubo? Brim,Ji?í Barnat
Electronic Proceedings in Theoretical Computer Science , 2011, DOI: 10.4204/eptcs.72.1
Abstract: The paper overviews recent developments in platform-dependent explicit-state LTL model checking.
Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation
Ji?í Barnat,Keijo Heljanko
Computer Science , 2011, DOI: 10.4204/EPTCS.72
Abstract: This volume contains the proceedings of the 10th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2011) that took place in Snowbird, Utah, on July 14, 2011. The workshop was co-located with 23rd International Conference on Computer Aided Verification (CAV 2011). The PDMC workshop series covers all aspects related to the verification and analysis of very large and complex systems using, in particular, methods and techniques that exploit contemporary, hence parallel, hardware architectures. To celebrate the 10th anniversary of PDMC, the workshop consisted of a half day invited session together and a half day session of regular contributed presentations.
DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking
Ji?í Barnat,Lubo? Brim,Milan ?e?ka
Electronic Proceedings in Theoretical Computer Science , 2009, DOI: 10.4204/eptcs.14.8
Abstract: In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-accelerated version of the algorithm and we discuss where the limits of the tool are and what we intend to do in the future to avoid them.
Computing Optimal Cycle Mean in Parallel on CUDA
Ji?í Barnat,Petr Bauch,Lubo? Brim,Milan ?e?ka
Electronic Proceedings in Theoretical Computer Science , 2011, DOI: 10.4204/eptcs.72.8
Abstract: Computation of optimal cycle mean in a directed weighted graph has many applications in program analysis, performance verification in particular. In this paper we propose a data-parallel algorithmic solution to the problem and show how the computation of optimal cycle mean can be efficiently accelerated by means of CUDA technology. We show how the problem of computation of optimal cycle mean is decomposed into a sequence of data-parallel graph computation primitives and show how these primitives can be implemented and optimized for CUDA computation. Finally, we report a fivefold experimental speed up on graphs representing models of distributed systems when compared to best sequential algorithms.
BioDiVinE: A Framework for Parallel Analysis of Biological Models
Ji?í Barnat,Lubo? Brim,Ivana ?erná,Sven Dra?an
Electronic Proceedings in Theoretical Computer Science , 2009, DOI: 10.4204/eptcs.6.3
Abstract: In this paper a novel tool BioDiVinEfor parallel analysis of biological models is presented. The tool allows analysis of biological models specified in terms of a set of chemical reactions. Chemical reactions are transformed into a system of multi-affine differential equations. BioDiVinE employs techniques for finite discrete abstraction of the continuous state space. At that level, parallel analysis algorithms based on model checking are provided. In the paper, the key tool features are described and their application is demonstrated by means of a case study.
Analysing Sanity of Requirements for Avionics Systems (Preliminary Version)
Ji?í Barnat,Petr Bauch,Nikola Bene?,Lubo? Brim,Jan Beran,Tomá? Kratochvíla
Computer Science , 2015,
Abstract: In the last decade it became a common practice to formalise software requirements to improve the clarity of users' expectations. In this work we build on the fact that functional requirements can be expressed in temporal logic and we propose new sanity checking techniques that automatically detect flaws and suggest improvements of given requirements. Specifically, we describe and experimentally evaluate approaches to consistency and redundancy checking that identify all inconsistencies and pinpoint their exact source (the smallest inconsistent set). We further report on the experience obtained from employing the consistency and redundancy checking in an industrial environment. To complete the sanity checking we also describe a semi-automatic completeness evaluation that can assess the coverage of user requirements and suggest missing properties the user might have wanted to formulate. The usefulness of our completeness evaluation is demonstrated in a case study of an aeroplane control system.
LTL Model Checking of Parametric Timed Automata
Peter Bezděk,Nikola Bene?,Vojtěch Havel,Ji?í Barnat,Ivana ?erná
Computer Science , 2014,
Abstract: The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The proposed problem could be solved using an explicit enumeration of all possible parameter valuations. However, we introduce a symbolic zone-based method for synthesising bounded integer parameters of parametric timed automata with an LTL specification. Our method extends the ideas of the standard automata-based approach to LTL model checking of timed automata. Our solution employs constrained parametric difference bound matrices and a suitable notion of extrapolation.
Control Explicit---Data Symbolic Model Checking: An Introduction
Jiri Barnat,Petr Bauch
Computer Science , 2013,
Abstract: A comprehensive verification of parallel software imposes three crucial requirements on the procedure that implements it. Apart from accepting real code as program input and temporal formulae as specification input, the verification should be exhaustive, with respect to both control and data flows. This paper is concerned with the third requirement, proposing to combine explicit model checking to handle the control with symbolic set representations to handle the data. The combination of explicit and symbolic approaches is first investigated theoretically and we report the requirements on the symbolic representation and the changes to the model checking process the combination entails. The feasibility and efficiency of the combination is demonstrated on a case study using the DVE modelling language and we report a marked improvement in scalability compared to previous solutions. The results described in this paper show the potential to meet all three requirements for automatic verification in a single procedure combining explicit model checking with symbolic set representations.
Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints
Maria Svorenova,Jana Tumova,Jiri Barnat,Ivana Cerna
Computer Science , 2012,
Abstract: Our goal in this paper is to plan the motion of a robot in a partitioned environment with dynamically changing, locally sensed rewards. We assume that arbitrary assumptions on the reward dynamics can be given. The robot aims to accomplish a high-level temporal logic surveillance mission and to locally optimize the collection of the rewards in the visited regions. These two objectives often conflict and only a compromise between them can be reached. We address this issue by taking into consideration a user-defined preference function that captures the trade-off between the importance of collecting high rewards and the importance of making progress towards a surveyed region. Our solution leverages ideas from the automata-based approach to model checking. We demonstrate the utilization and benefits of the suggested framework in an illustrative example.
Extensions and Applications of the Bohm Criterion
Scott D. Baalrud,Brett Scheiner,Benjamin Yee,Matthew Hopkins,Edward Barnat
Physics , 2014, DOI: 10.1088/0741-3335/57/4/044003
Abstract: The generalized Bohm criterion is revisited in the context of incorporating kinetic effects of the electron and ion distribution functions into the theory. The underlying assumptions and results of two different approaches are compared: The conventional `kinetic Bohm criterion' and a fluid-moment hierarchy approach. The former is based on the asymptotic limit of an infinitely thin sheath ($\lambda_D/l =0$), whereas the latter is based on a perturbative expansion of a sheath that is thin compared to the plasma ($\lambda_D/l \ll 1$). Here $\lambda_D$ is the Debye length, which characterizes the sheath length scale, and $l$ is a measure of the plasma or presheath length scale. The consequences of these assumptions are discussed in terms of how they restrict the class of distribution functions to which the resulting criteria can be applied. Two examples are considered to provide concrete comparisons between the two approaches. The first is a Tonks-Langmuir model including a warm ion source [Robertson 2009 \textit{Phys.\ Plasmas} {\bf 16} 103503]. This highlights a substantial difference between the conventional kinetic theory, which predicts slow ions dominate at the sheath edge, and the fluid moment approach, which predicts slow ions have little influence. The second example considers planar electrostatic probes biased near the plasma potential using model equations and particle-in-cell simulations. This demonstrates a situation where electron kinetic effects alter the Bohm criterion, leading to a subsonic ion flow at the sheath edge.
Page 1 /15472
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.