From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- 31 March 2017
- book chapter
- Published by Springer Nature
- p. 426-442
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Profile trees for Büchi word automata, with application to determinizationInformation and Computation, 2015
- Limit Deterministic and Probabilistic Automata for LTL ∖ GU2015
- Comparison of LTL to Deterministic Rabin Automata TranslatorsLecture Notes in Computer Science, 2013
- The Blow-Up in Translating LTL to Deterministic Automata2011
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking2008
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity AutomataLogical Methods in Computer Science, 2007
- “More Deterministic” vs. “Smaller” Büchi Automata for Efficient LTL Model CheckingLecture Notes in Computer Science, 2003
- Weak alternating automata are not that weakACM Transactions on Computational Logic, 2001
- Optimal Bounds for Transformations of ω-Automata1999
- The complexity of probabilistic verificationJournal of the ACM, 1995