1,343 research outputs found
Time-Constrained Temporal Logic Control of Multi-Affine Systems
In this paper, we consider the problem of controlling a dynamical system such
that its trajectories satisfy a temporal logic property in a given amount of
time. We focus on multi-affine systems and specifications given as
syntactically co-safe linear temporal logic formulas over rectangular regions
in the state space. The proposed algorithm is based on the estimation of time
bounds for facet reachability problems and solving a time optimal reachability
problem on the product between a weighted transition system and an automaton
that enforces the satisfaction of the specification. A random optimization
algorithm is used to iteratively improve the solution
An Efficient Formula Synthesis Method with Past Signal Temporal Logic
In this work, we propose a novel method to find temporal properties that lead
to the unexpected behaviors from labeled dataset. We express these properties
in past time Signal Temporal Logic (ptSTL). First, we present a novel approach
for finding parameters of a template ptSTL formula, which extends the results
on monotonicity based parameter synthesis. The proposed method optimizes a
given monotone criteria while bounding an error. Then, we employ the parameter
synthesis method in an iterative unguided formula synthesis framework. In
particular, we combine optimized formulas iteratively to describe the causes of
the labeled events while bounding the error. We illustrate the proposed
framework on two examples.Comment: 8 pages, 5 figures, conference pape
A Formal Methods Approach to Pattern Synthesis in Reaction Diffusion Systems
We propose a technique to detect and generate patterns in a network of
locally interacting dynamical systems. Central to our approach is a novel
spatial superposition logic, whose semantics is defined over the quad-tree of a
partitioned image. We show that formulas in this logic can be efficiently
learned from positive and negative examples of several types of patterns. We
also demonstrate that pattern detection, which is implemented as a model
checking algorithm, performs very well for test data sets different from the
learning sets. We define a quantitative semantics for the logic and integrate
the model checking algorithm with particle swarm optimization in a
computational framework for synthesis of parameters leading to desired patterns
in reaction-diffusion systems
- …