Reduction and covering of infinite reachability trees
Information and Computation
Finite-valued distance automata
Selected papers of the second international colloquium on Words, languages and combinatorics
Well-structured transition systems everywhere!
Theoretical Computer Science
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
TReX: A Tool for Reachability Analysis of Complex Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Enhancements of partitioning techniques for image compression using weighted finite automata
Theoretical Computer Science - Implementation and application automata
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
Theoretical Computer Science - Developments in language theory
Weighted automata and weighted logics
Theoretical Computer Science
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Optimal reachability for multi-priced timed automata
Theoretical Computer Science
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters
FAST: acceleration from theory to practice
International Journal on Software Tools for Technology Transfer (STTT)
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Towards an Efficient Implementation of Tree Automata Completion
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Structural Presburger digit vector automata
Theoretical Computer Science
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper is dedicated to candidate abstractions to capture relevant aspects of the integer weighted automata. The expected effect of applying these abstractions is studied to build the deterministic reachability graphs allowing us to semi-decide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings.