Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
On syntactic congruences for &ohgr;-languages
Theoretical Computer Science - Special issue: formal language theory
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On the Construction of Automata from Linear Arithmetic Constraints
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
A Comparison of Presburger Engines for EFSM Reachability
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Memory Efficient Algorithms for the Verification of Temporal Properties
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Handling Liveness Properties in (ω-)Regular Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Use of Automata-based Techniques in Symbolic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
On the succinctness of nondeterminism
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Strength-Based decomposition of the property Büchi automaton for faster model checking
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some difficult and delicate to implement algorithms. The contribution of this paper is to show, using topological arguments, that only a restricted class of automata on infinite words are necessary for handling real and integer linear arithmetic. This allows the use of substantially simpler algorithms and opens the path to the implementation of a usable system for handling this combined theory.