Limit Deterministic and Probabilistic Automata for LTL ∖ GU
Authors:
- 1 January 2015
- book chapter
- Published by Springer Nature
- p. 628-642
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- From LTL to Deterministic Automata: A Safraless Compositional Approach2014
- Probabilistic Automata for Safety LTL Specifications2014
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment2013
- Rabinizer 2: Small Deterministic Automata for LTL ∖ GU2013
- Deterministic Automata for the (F,G)-Fragment of LTL2012
- From LTL to Symbolically Represented Deterministic Automata2008
- Experiments with deterministic-automata for formulas of linear temporal logicTheoretical Computer Science, 2006
- Deterministic generators and games for Ltl fragmentsACM Transactions on Computational Logic, 2004
- Fast LTL to Büchi Automata Translation2001
- The complexity of probabilistic verificationJournal of the ACM, 1995