Modules

Here is a list of all modules:

[detail level 1234]

▼Hard-coded families of formulas or automata.
Hard-coded families of automata.
Hard-coded families of formulas.
▼Miscellaneous helper functions
Graph Data Structures
Hashing functions
Random functions
▼Temporal Logic
Environment classes for atomic propositions
Essential Temporal Logic Types
Input and Output of Formulas
Rewriting Algorithms for Formulas
Algorithms related to the temporal hierarchy
Miscellaneous Algorithms for Formulas
▼TωA (Transition-based ω-Automata)
LTSmin Interface
Parallel Model Checking
Kripke Structures
Essential TωA types
TωA representations
▼TωA algorithms
Language containment checks
TωA on-the-fly algorithms
Input/Output of TωA
Stutter-invariance checks and related functions
▼Conversion between acceptance conditions
Algorithms for parity acceptance
Translating LTL formulas into TωA
Algorithm patterns
TωA simplifications
Miscellaneous algorithms on TωA
▼Emptiness-checks
Emptiness-check algorithms
TωA runs and supporting functions
Emptiness-check statistics
Functions related to game solving
Functions related to Mealy machines
Reactive Synthesis
Multi-Terminal DFAs