The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Digital images and formal languages
Handbook of formal languages, vol. 3
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Finite-state transducers in language and speech processing
Computational Linguistics
An Abstraction-Refinement Framework for Multi-Agent Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Thorough static analysis of device drivers
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Co-ing Büchi Made Tight and Useful
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Solving games via three-valued abstraction refinement
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Parameterized weighted containment
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Rigorous approximated determinization of weighted automata
Theoretical Computer Science
Cost preserving bisimulations for probabilistic automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
Weighted automata map input words to real numbers and are useful in reasoning about quantitative systems and specifications. The containment problem for weighted automata asks, given two weighted automata $\mathcal{A}$ and $\mathcal{B}$, whether for all words w, the value that $\mathcal{A}$ assigns to w is less than or equal to the value $\mathcal{B}$ assigns to w. The problem is of great practical interest, yet is known to be undecidable. Efforts to approximate weighted containment by weighted variants of the simulation pre-order still have to cope with large state spaces. One of the leading approaches for coping with large state spaces is abstraction. We introduce an abstraction-refinement paradigm for weighted automata and show that it nicely combines with weighted simulation, giving rise to a feasible approach for the containment problem. The weighted-simulation pre-order we define is based on a quantitative two-player game, and the technical challenge in the setting origins from the fact the values that the automata assign to words are unbounded. The abstraction-refinement paradigm is based on under- and over-approximation of the automata, where approximation, and hence also the refinement steps, refer not only to the languages of the automata but also to the values they assign to words.