Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Complementing deterministic Bu¨chi automata in polynomial time
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
On syntactic congruences for &ohgr;-languages
Theoretical Computer Science - Special issue: formal language theory
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Efficient minimization of deterministic weak &ohgr;-automata
Information Processing Letters
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference 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
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
SIAM Journal on Computing
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Verifying a signature architecture: a comparative case study
Formal Aspects of Computing
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
Don't care words with an application to the automata-based approach for real addition
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
LTL to büchi automata translation: fast and more deterministic
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
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
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
Automata over infinite words provide a powerful framework to solve various decision problems. However, the mechanized reasoning with restricted classes of automata over infinite words is often simpler and more efficient. For instance, weak deterministic Büchi automata (WDBAS) can be handled algorithmically almost as efficient as deterministic automata over finite words. In this paper, we show how and when the standard powerset construction for automata over finite words can be used to determinize automata over infinite words. An instance is the class of automata that accept WDBA-recognizable languages. Furthermore, we present applications of this new determinization construction. Namely, we apply it to improve the automata-based approach for the mixed firstorder linear arithmetic over the reals and the integers, and we utilize it to accelerate finite state model checking. We report on experimental results for these two applications.