Three partition refinement algorithms
SIAM Journal on Computing
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Languages, automata, and logic
Handbook of formal languages, vol. 3
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
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
Deterministic w Automata vis-a-vis Deterministic Buchi Automata
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Language containment of non-deterministic omega-automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th 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
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Observations on determinization of büchi automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
On-the-fly stuttering in the construction of deterministic ω-automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Generalized rabin(1) synthesis with applications to robust system synthesis
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Minimising deterministic Büchi automata precisely using SAT solving
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
RV'11 Proceedings of the Second international conference on Runtime verification
Deterministic automata for the (f, g)-fragment of LTL
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Rabinizer: small deterministic automata for LTL (F,G)
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
LTL model checking of interval markov chains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Temporal logic robot control based on automata learning of environmental dynamics
International Journal of Robotics Research
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
This paper addresses the problem of generating deterministic ω-automata for formulas of linear temporal logic, which can be solved by applying well-known algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra's determinization algorithm, present several heuristics that attempt to decrease the size of the resulting automata and report on experimental results.