Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 24-39
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis2013
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment2013
- Compositional Approach to Suspension and Other Improvements to LTL TranslationLecture Notes in Computer Science, 2013
- LTL to Büchi Automata Translation: Fast and More Deterministic2012
- LTL Translation Improvements in SpotElectronic Workshops in Computing, 2011
- Deterministic generators and games for Ltl fragmentsACM Transactions on Computational Logic, 2004
- On-the-fly Verification of Linear Temporal Logic1999
- Patterns in property specifications for finite-state verification1999
- Improved Automata Generation for Linear Temporal Logic1999
- The complexity of probabilistic verificationJournal of the ACM, 1995