Degeneralization algorithm for generation of Büchi automata based on contented situation

DOI10.1155/2015/516104zbMATH Open1350.68187DBLPjournals/jam/ShanQCQ15OpenAlexW2044960860WikidataQ59111869 ScholiaQ59111869MaRDI QIDQ327746FDOQ327746

Authors: Jun Qin, Mingshi Chen, Zheng Qin, Laixiang Shan 

Publication date: 19 October 2016

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/516104

Recommendations

• Efficient approach of translating LTL formulae into Büchi automata
• scientific article; zbMATH DE number 1796123
• Model Checking Software
• scientific article; zbMATH DE number 1670781
• scientific article; zbMATH DE number 6401143

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• Three SCC-based emptiness checks for generalized Büchi automata
• LTL to Büchi automata translation: fast and more deterministic
• Alternation removal in Büchi automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• SPIN
• SPOT
• LTL2BA
• lbtt

This page was built for publication: Degeneralization algorithm for generation of Büchi automata based on contented situation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327746)