A symbolic decision procedure for symbolic alternating finite automata

DOI10.1016/j.entcs.2018.03.017OpenAlexW2964023591WikidataQ113317563 ScholiaQ113317563MaRDI QIDQ2130584

Loris D'Antoni, Fang Wang, Zachary Kincaid

Publication date: 25 April 2022

Full work available at URL: https://arxiv.org/abs/1610.01722

zbMATH Keywords

automatadecision procedures

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• MONA
• Sat4j
• Rex

Cites Work

• A general account of coinduction up-to
• On equations for regular languages, finite automata, and sequential networks
• DReX
• Checking NFA equivalence with bisimulations up to congruence
• MONA IMPLEMENTATION SECRETS
• Forward Bisimulations for Nondeterministic Symbolic Finite Automata
• Alternation
• On the bisimulation proof method
• Symbolic Automata Constraint Solving
• Minimization of symbolic automata
• Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A symbolic decision procedure for symbolic alternating finite automata