57,181 research outputs found
Transformational Verification of Linear Temporal Logic
We present a new method for verifying Linear Temporal
Logic (LTL) properties of finite state reactive systems based on logic programming and program transformation. We encode a finite state system and an LTL property which we want to verify as a logic program on infinite lists. Then we apply a verification method consisting of two steps. In the first step we transform the logic program that encodes the given system and the given property into a new program belonging to the class of the so-called linear monadic !-programs (which are stratified, linear recursive programs defining nullary predicates or unary predicates on infinite lists). This transformation is performed by applying rules that preserve correctness. In the second step we verify the property of interest by using suitable proof rules for linear monadic !-programs. These proof rules can be encoded as a logic program which always terminates, if evaluated by using tabled resolution. Although our method uses standard
program transformation techniques, the computational complexity of the derived verification algorithm is essentially the same as the one of the Lichtenstein-Pnueli algorithm [9], which uses sophisticated ad-hoc techniques
Receding Horizon Temporal Logic Control for Finite Deterministic Systems
This paper considers receding horizon control of finite deterministic
systems, which must satisfy a high level, rich specification expressed as a
linear temporal logic formula. Under the assumption that time-varying rewards
are associated with states of the system and they can be observed in real-time,
the control objective is to maximize the collected reward while satisfying the
high level task specification. In order to properly react to the changing
rewards, a controller synthesis framework inspired by model predictive control
is proposed, where the rewards are locally optimized at each time-step over a
finite horizon, and the immediate optimal control is applied. By enforcing
appropriate constraints, the infinite trajectory produced by the controller is
guaranteed to satisfy the desired temporal logic formula. Simulation results
demonstrate the effectiveness of the approach.Comment: Technical report accompanying a paper to be presented at ACC 201
Propositional Dynamic Logic for Message-Passing Systems
We examine a bidirectional propositional dynamic logic (PDL) for finite and
infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of
multi-modal logic we can express properties both in the entire future and in
the past of an event. Path expressions strengthen the classical until operator
of temporal logic. For every formula defining an MSC language, we construct a
communicating finite-state machine (CFM) accepting the same language. The CFM
obtained has size exponential in the size of the formula. This synthesis
problem is solved in full generality, i.e., also for MSCs with unbounded
channels. The model checking problem for CFMs and HMSCs turns out to be in
PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with
intersection, the semantics of a formula cannot be captured by a CFM anymore
- …