diff options
| author | Camil Staps | 2018-04-19 20:20:34 +0200 |
|---|---|---|
| committer | Camil Staps | 2018-04-19 20:20:34 +0200 |
| commit | 7c494a70444b039c972b4bd40d3949991cba3e22 (patch) | |
| tree | a55a40c06748d94bf45a25cd9a94cd88e8c17a52 /Assignment1/conversion.tex | |
| parent | Fix vertical placing of Xop (diff) | |
| parent | Merge branch 'master' of gitlab.science.ru.nl:eveen/Model-Checking (diff) | |
Merge branch 'master' of gitlab.science.ru.nl:eveen/Model-Checking
Diffstat (limited to 'Assignment1/conversion.tex')
| -rw-r--r-- | Assignment1/conversion.tex | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/Assignment1/conversion.tex b/Assignment1/conversion.tex index e474f74..72624e6 100644 --- a/Assignment1/conversion.tex +++ b/Assignment1/conversion.tex @@ -417,6 +417,10 @@ Choose $V := \{1, 2, \dots, 2\cdot|Q|\}$ for denoting nodes in Safra trees. \] \end{enumerate} +The last step of the algorithm is converting the Muller automaton to an LTL formula based on the decomposition of automata as described by O. Maler and A. Pnueli~\cite{Maler1994}. +The decomposition of finite automata was first described by K. Krohn and J. Rhodes as is known as the Krohn-Rhodes theorem~\cite{Krohn1965}. +This theorem, in combination with the work of A. Meyer~\cite{Meyer1969} allows for the translation of Muller automaton to LTL. + \cbend %Provide the syntactic algorithm to convert PLTL to LTL %TODO: Provide algorithm via automata to convert PLTL to LTL |