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

DOI10.1155/2015/516104zbMath1350.68187DBLPjournals/jam/ShanQCQ15OpenAlexW2044960860WikidataQ59111869 ScholiaQ59111869MaRDI QIDQ327746

Zheng Qin, Jun Qin, Mingshi Chen, Lai-Xiang 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

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)

Uses Software

• SPIN
• SPOT
• LTL2BA
• lbtt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Graph-Based Algorithms for Boolean Function Manipulation

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