[KNIHA][B] Formal methods for discrete-time dynamical systems
In control theory, complex models of physical processes, such as systems of differential or
difference equations, are usually checked against simple specifications, such as stability …
difference equations, are usually checked against simple specifications, such as stability …
Spot 2.0—a framework for LTL and-automata manipulation
A Duret-Lutz, A Lewkowicz, A Fauchille… - … for Verification and …, 2016 - Springer
Abstract We present Spot 2.0, a C++ library with Python bindings and an assortment of
command-line tools designed to manipulate LTL and ω-automata in batch. New automata …
command-line tools designed to manipulate LTL and ω-automata in batch. New automata …
Optimal path planning for surveillance with temporal-logic constraints
In this paper we present a method for automatically generating optimal robot paths satisfying
high-level mission specifications. The motion of the robot in the environment is modeled as a …
high-level mission specifications. The motion of the robot in the environment is modeled as a …
Boosting multi-core reachability performance with shared hash tables
This paper focuses on data structures for multi-core reachability, which is a key component
in model checking algorithms and other verification methods. A cornerstone of an efficient …
in model checking algorithms and other verification methods. A cornerstone of an efficient …
Multi-robot deployment from LTL specifications with reduced communication
In this paper, we develop a computational framework for fully automatic deployment of a
team of unicycles from a global specification given as an LTL formula over some regions of …
team of unicycles from a global specification given as an LTL formula over some regions of …
Parallel model checking algorithms for linear-time temporal logic
Abstract Model checking is a fully automated, formal method for demonstrating absence of
bugs in reactive systems. Here, bugs are violations of properties in Linear-time Temporal …
bugs in reactive systems. Here, bugs are violations of properties in Linear-time Temporal …
Optimal multi-robot path planning with temporal logic constraints
In this paper we present a method for automatically planning optimal paths for a group of
robots that satisfy a common high level mission specification. Each robot's motion in the …
robots that satisfy a common high level mission specification. Each robot's motion in the …
Optimal path planning under temporal logic constraints
In this paper we present a method for automatically generating optimal robot trajectories
satisfying high level mission specifications. The motion of the robot in the environment is …
satisfying high level mission specifications. The motion of the robot in the environment is …
Formal analysis of piecewise affine systems through formula-guided refinement
We present a computational framework for identifying a set of initial states from which all
trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Logic (LTL) …
trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Logic (LTL) …
Improved distributed virtual forces algorithm for 3D terrains coverage in mobile wireless sensor networks
N Boufares, YB Saied… - 2018 IEEE/ACS 15th …, 2018 - ieeexplore.ieee.org
Wireless sensor networks (WSNs) are composed of collaborating sensor nodes that are able
to sense the environment in order to monitor physical phenomena and to track moving …
to sense the environment in order to monitor physical phenomena and to track moving …