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 …
LTL to Büchi automata translation: Fast and more deterministic
We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae
into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi …
into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi …
Linear encodings of bounded LTL model checking
We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL).
We present several efficient encodings that have size linear in the bound. Furthermore, we …
We present several efficient encodings that have size linear in the bound. Furthermore, we …
The Hanoi omega-automata format
We propose a flexible exchange format for ω-automata, as typically used in formal
verification, and implement support for it in a range of established tools. Our aim is to simplify …
verification, and implement support for it in a range of established tools. Our aim is to simplify …
Specification-compliant driving corridors for motion planning of automated vehicles
It is crucial for automated vehicles to explicitly comply with specifications, including traffic
rules, to ensure their safe and effective participation in road traffic. Such compliance is also …
rules, to ensure their safe and effective participation in road traffic. Such compliance is also …
LTL satisfiability checking
We report here on an experimental investigation of LTL satisfiability checking via a reduction
to model checking. By using large LTL formulas, we offer challenging model-checking …
to model checking. By using large LTL formulas, we offer challenging model-checking …
LTL satisfiability checking
We report here on an experimental investigation of LTL satisfiability checking via a reduction
to model checking. By using large LTL formulas, we offer challenging model-checking …
to model checking. By using large LTL formulas, we offer challenging model-checking …
Efficient model checking of safety properties
T Latvala - Model Checking Software: 10th International SPIN …, 2003 - Springer
We consider the problems of identifying LTL safety properties and translating them to finite
automata. We present an algorithm for constructing finite automata recognising informative …
automata. We present an algorithm for constructing finite automata recognising informative …
Simple bounded LTL model checking
LNCS 3312 - Simple Bounded LTL Model Checking Page 1 Simple Bounded LTL Model
Checking Timo Latvala1,⋆ , Armin Biere2, Keijo Heljanko1,⋆⋆ , and Tommi Junttila3,⋆⋆⋆ 1 …
Checking Timo Latvala1,⋆ , Armin Biere2, Keijo Heljanko1,⋆⋆ , and Tommi Junttila3,⋆⋆⋆ 1 …
LTL translation improvements in Spot 1.0
A Duret-Lutz - … Journal of Critical Computer-Based Systems …, 2014 - inderscienceonline.com
Spot is a library of model-checking algorithms started in 2003. This paper focuses on its
module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of …
module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of …