Seminator: A Tool for Semi-Determinization of Omega-Automata

We present a tool that transforms nondeterministic omega-automata to semi-deterministic omega-automata. The tool Seminator accepts transition-based generalized Buchi automata (TGBA) as an input and produces automata with two kinds of semi-determinism. The implemented procedure performs degeneralization and semi-determinization simultaneously and employs several other optimizations. We experimentally evaluate Seminator in the context of LTL to semi-deterministic automata translation.

[1]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Alexandre Duret-Lutz.  Manipulating LTL Formulas Using Spot 1.0 , 2013, ATVA.

[3]  Jan Kretínský,et al.  The Hanoi Omega-Automata Format , 2015, CAV.

[4]  George S. Avrunin,et al.  Property specification patterns for finite-state verification , 1998, FMSP '98.

[5]  Alexandre Duret-Lutz,et al.  Compositional Approach to Suspension and Other Improvements to LTL Translation , 2013, SPIN.

[6]  Jan Kretínský,et al.  Limit-Deterministic Büchi Automata for Linear Temporal Logic , 2016, CAV.

[7]  Sven Schewe,et al.  Complementing Semi-deterministic Büchi Automata , 2016, TACAS.

[8]  Lijun Zhang,et al.  Lazy Probabilistic Model Checking without Determinisation , 2013, CONCUR.

[9]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  Vojtech Rehák,et al.  LTL to Büchi Automata Translation: Fast and More Deterministic , 2012, TACAS.

[11]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[12]  Mahesh Viswanathan,et al.  Limit Deterministic and Probabilistic Automata for LTL ∖ GU , 2015, TACAS.

[13]  Alexandre Duret-Lutz,et al.  Spot 2 . 0 — a framework for LTL and ω-automata manipulation , 2016 .

[14]  Mihalis Yannakakis,et al.  Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  Jan Kretínský,et al.  MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata , 2016, ATVA.

[16]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[17]  David Šafránek,et al.  Verification Results in Liberouter Project , 2004 .

[18]  Radek Pelánek,et al.  BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.

[19]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.