Converting Linear-Time Temporal Logic to Generalized Büchi Automata (Q7361954)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry LTL_to_GBA
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Converting Linear-Time Temporal Logic to Generalized Büchi Automata |
AFP entry LTL_to_GBA |
Statements
28 May 2014
0 references
Alexander Schimpf
0 references
Peter Lammich
0 references
Converting Linear-Time Temporal Logic to Generalized Büchi Automata (English)
0 references
We formalize linear-time temporal logic (LTL) and the algorithm by Gerth et al. to convert LTL formulas to generalized Büchi automata. We also formalize some syntactic rewrite rules that can be applied to optimize the LTL formula before conversion. Moreover, we integrate the Stuttering Equivalence AFP-Entry by Stefan Merz, adapting the lemma that next-free LTL formula cannot distinguish between stuttering equivalent runs to our setting. We use the Isabelle Refinement and Collection framework, as well as the Autoref tool, to obtain a refined version of our algorithm, from which efficiently executable code can be extracted.
0 references
