A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
From MaRDI portal
Publication:3303894
DOI10.1007/978-3-662-54577-5_12zbMath1453.68098arXiv1610.07380OpenAlexW2543156873MaRDI QIDQ3303894
Depeng Liu, Yu-Fang Chen, Yong Li, Li-jun Zhang
Publication date: 5 August 2020
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07380
Related Items
Learning One-Clock Timed Automata, Unnamed Item, Concurrent Kleene algebra with observations: from hypotheses to completeness, Polynomial Identification of $$\omega $$-Automata, Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys, Inferring switched nonlinear dynamical systems, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning register automata: from languages to program structures
- Learning regular sets from queries and counterexamples
- Recognizing safety and liveness
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Queries and concept learning
- Inference of finite automata using homing sequences
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems
- Inferring Canonical Register Automata
- Learning Regular Omega Languages
- Büchi Store: An Open Repository of Büchi Automata
- Advanced Ramsey-Based Büchi Automata Inclusion Testing
- Learning the Language of Error
- Learning Minimal Separating DFA’s for Compositional Verification
- Families of DFAs as Acceptors of omega-Regular Languages
- The size-change principle for program termination
- Synthesis of interface specifications for Java classes
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Computer Aided Verification
- Computer Aided Verification
- Ultimately periodic words of rational ω-languages
