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

org: Add a Concepts page.

Browse source 
* doc/org/concepts.org: New file.
* doc/Makefile.am: Add it.
* doc/org/oaut.org: Add anchor.
* doc/org/index.org, doc/org/tut.org: Add links to concepts.org.
* doc/org/spot.css: Set up boxes for implementation details.
* NEWS: Mention the new page.
This commit is contained in:
Alexandre Duret-Lutz 2016-01-21 18:58:46 +01:00
parent 2364ff8148
commit 78fd7beaaf
7 changed files with 982 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

11
doc/org/index.org
View file

@ -6,16 +6,17 @@
Spot is a C++11 library for ω-automata manipulation and model
checking. It has the following notable features:
- Support for LTL (several syntaxes supported) and the linear fragment
of PSL.
- Support for ω-automata with arbitrary acceptance condition.
- Support for transition-based acceptance (state-based acceptance is
- Support for [[file:concepts.org::#ltl][LTL]] (several syntaxes supported) and
[[file:concepts.org::#psl][the linear fragment of PSL]].
- Support for ω-automata with [[file:concepts.org::#acceptance-condition][arbitrary acceptance condition]].
- Support for [[file:concepts.org::#trans-acc][transition-based acceptance]] (state-based acceptance is
supported by a reduction to transition-based acceptance).
- The automaton parser can read a stream of automata written in any of
four syntaxes ([[file:hoa.org][HOA]], [[http://spinroot.com/spin/Man/never.html][never claims]], [[http://www.tcs.hut.fi/Software/lbtt/doc/html/Format-for-automata.html][LBTT]], [[http://www.ltl2dstar.de/docs/ltl2dstar.html][DSTAR]]).
- Several algorithms for formula manipulation including: simplifying
formulas, testing implication or equivalence, testing
stutter-invariance, removing some operators by rewriting, ...
stutter-invariance, removing some operators by rewriting, translation
to automata...
- Several algorithms for automata manipulation including: product,
emptiness checks, simulation-based reductions, minimization of
weak-DBA, removal of useless SCCs, acceptance-condition