Universality of Büchi Automata: Analysis With Graph Neural Networks

Universality of Büchi Automata: Analysis With Graph Neural Networks

The universality check of Büchi automata is a foundational problem in automata-based formal verification, closely related to the complementation problem, and is known to be computationally difficult, more concretely: PSPACE-complete. This article introduces a novel approach for creating l...

Full description

Bibliographic Details
Main Authors: Christophe Stammet, Ulrich Ultes-Nitsche, Andreas Fischer
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Automata
computational complexity
formal verification
graph neural networks
machine learning
Online Access:https://ieeexplore.ieee.org/document/10342855/

Internet

https://ieeexplore.ieee.org/document/10342855/

Similar Items