Converting A Subset of LTL Formula to Buchi Automata
Overview & Synopsis
The translation of LTL formula into equivalent Büchi automata plays an important role in many algorithms for LTL model checking, which consist in obtaining a Büchi automaton that is equivalent to the software system specification and another one that is equivalent to the negation of the property. The intersection of the two Büchi automata is empty if the model satisfies the property.
Indexed from repository: Zenodo
(
zenodo.org)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Converting A Subset of LTL Formula to Buchi Automata |
|---|---|
| Author / Organization | BilalTanaydın |
| Subject & Discipline | Scientific Research & Data |
| Categories | Science & Mathematics |
| Publication Year | 2019 |
| License / Rights | cc-by-4.0 |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
Zenodo
(zenodo.org)
|
| File Format | application/pdf (Portable Document Format) |
| Reported File Size | 2075.4 KB (2,125,250 bytes) |
| Language | EN |
| Catalog ID | DOC-124451 |
| Original Source Link | Visit Source Page on zenodo.org » |