On the use of weak automata for deciding linear arithmetic with integer and real variables
From MaRDI portal
Recommendations
- An effective decision procedure for linear arithmetic over the integers and reals
- Representing arithmetic constraints with finite automata: An overview
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- On the expressiveness of real and integer arithmetic automata. (Extended abstract)
- Convex Hull of Arithmetic Automata
Cited in
(15)- Certifying inexpressibility
- An analogue of Cobham's theorem for graph directed iterated function systems
- Relating word and tree automata
- Symbolic model checking in non-Boolean domains
- New optimizations and heuristics for determinization of Büchi automata
- Convex Hull of Arithmetic Automata
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
- Representing arithmetic constraints with finite automata: An overview
- Analyzing restricted fragments of the theory of linear arithmetic
- An effective decision procedure for linear arithmetic over the integers and reals
- Weak automata for the linear time -calculus
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- Complementing Büchi Automata with Ranker
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Approaching arithmetic theories with finite-state automata
This page was built for publication: On the use of weak automata for deciding linear arithmetic with integer and real variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539644)