On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
- 8 June 2001
- book chapter
- Published by Springer Nature
- p. 611-625
- https://doi.org/10.1007/3-540-45744-5_50
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Efficient minimization of deterministic weakInformation Processing Letters, 2001
- An automata-theoretic approach to branching-time model checkingJournal of the ACM, 2000
- A comparison of Presburger engines for EFSM reachabilityPublished by Springer Nature ,1998
- On the expressiveness of real and integer arithmetic automataPublished by Springer Nature ,1998
- On syntactic congruences for ω-languagesTheoretical Computer Science, 1997
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- The complementation problem for Büchi automata with applications to temporal logicTheoretical Computer Science, 1987
- Automata-theoretic techniques for modal logics of programsJournal of Computer and System Sciences, 1986
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960