alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

* doc/org/index.org: Remove up/home links.

Browse source
This commit is contained in:
Alexandre Duret-Lutz 2015-06-17 22:33:23 +02:00
parent c1a735b164
commit 286775ee68
1 changed files with 14 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

26
doc/org/index.org
View file

@ -1,29 +1,31 @@
# -*- coding: utf-8 -*- # -*- coding: utf-8 -*-
#+TITLE: Spot #+TITLE: Spot
#+SETUPFILE: setup.org #+SETUPFILE: setup.org
#+HTML_HEAD_EXTRA: <style>#org-div-home-and-up { display: none; }</style>
Spot is a C++11 library for ω-automata manipulation and model Spot is a C++11 library for ω-automata manipulation and model
checking. It has the following notable features: checking. It has the following notable features:
- Support for LTL (several syntaxes supported) and the linear fragment of PSL. - Support for LTL (several syntaxes supported) and the linear fragment
of PSL.
- Support for ω-automata with arbitrary acceptance condition. - Support for ω-automata with arbitrary acceptance condition.
- Support for transition-based acceptance (state-based acceptance - Support for transition-based acceptance (state-based acceptance is
is supported by a reduction to transition-based acceptance). supported by a reduction to transition-based acceptance).
- The automaton parser can read a stream of automata written in any of - The automaton parser can read a stream of automata written in any of
three syntaxes ([[http://spinroot.com/spin/Man/never.html][never claims]], [[file:hoa.org][HOA]], or [[http://www.tcs.hut.fi/Software/lbtt/doc/html/Format-for-automata.html][LBTT]]). three syntaxes ([[http://spinroot.com/spin/Man/never.html][never claims]], [[file:hoa.org][HOA]], or [[http://www.tcs.hut.fi/Software/lbtt/doc/html/Format-for-automata.html][LBTT]]).
- Several algorithms for formula manipulation including: simplifying - Several algorithms for formula manipulation including: simplifying
formulas, testing implication or equivalence, testing formulas, testing implication or equivalence, testing
stutter-invariance, removing some operators by rewriting, ... stutter-invariance, removing some operators by rewriting, ...
- Several algorithms for automata manipulation including: product, - Several algorithms for automata manipulation including: product,
emptiness checks, simulation-based reductions, emptiness checks, simulation-based reductions, minimization of
minimization of weak-DBA, removal of useless SCCs, weak-DBA, removal of useless SCCs, acceptance-condition
acceptance-condition transformations, etc. transformations, etc.
- In addition to the C++ interface, most of its algorithms - In addition to the C++ interface, most of its algorithms are usable
are usable via [[file:tools.org][command-line tools]], and via Python bindings. via [[file:tools.org][command-line tools]], and via Python bindings.
- One of the command-line tool, called [[file:ltlcross.org][=ltlcross=]] is a rewrite - One of the command-line tool, called [[file:ltlcross.org][=ltlcross=]] is a rewrite of
of [[http://www.tcs.hut.fi/Software/lbtt/][LBTT]], but with support for PSL and arbitrary acceptance conditions. [[http://www.tcs.hut.fi/Software/lbtt/][LBTT]], but with support for PSL and arbitrary acceptance conditions.
It could for instance be used to test tools that translate It could for instance be used to test tools that translate LTL into
LTL into Rabin automata. Rabin automata.
* Latest version * Latest version