Amortized efficiency of list update and paging rules
Communications of the ACM
Semirings, automata, languages
Semirings, automata, languages
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Fairness
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Competitive algorithms for server problems
Journal of Algorithms
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
On the development of reactive systems
Logics and models of concurrent systems
New results on server problems
SIAM Journal on Discrete Mathematics
Online matching with blocked input
Information Processing Letters
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
On competitive on-line paging with lookahead
Theoretical Computer Science
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Finite-state transducers in language and speech processing
Computational Linguistics
Environment Assumptions for Synthesis
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
Rigorous Approximated Determinization of Weighted Automata
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Verifying quantitative properties using bound functions
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Degrees of lookahead in regular infinite games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.01 |
In [2], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in R≥0. By relating the "unbounded look ahead" of optimal offline algorithms with nondeterminism, and relating the "no look ahead" of online algorithms with determinism, we were able to solve problems about the competitive ratio of online algorithms and the memory they require. In this paper we improve the application in three important and technically challenging aspects. First, we allow the competitive analysis to take into account assumptions about the environment. Second, we allow the online algorithm to have a bounded lookahead. Third, we describe a symbolic version of the modelchecking algorithm and demonstrate its applicability. The first two contributions broaden the scope of our approach to settings in which the traditional analysis of online algorithms is particularly complicated. The third contribution improves the practicality of our approach and enables it to handle larger state spaces.