Validity Checking for Finite Automata over Linear Arithmetic Constraints
From MaRDI portal
Recommendations
- On the construction of automata from linear arithmetic constraints
- Representing arithmetic constraints with finite automata: An overview
- An effective decision procedure for linear arithmetic over the integers and reals
- Symbolic automata constraint solving
- Automata-based representations for arithmetic constraints in automated verification
This page was built for publication: Validity Checking for Finite Automata over Linear Arithmetic Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386003)