Spot 2 . 0 — a framework for LTL and ω-automata manipulation

We present Spot 2.0, a C++ library with Python bindings and an assortment of command-line tools designed to manipulate LTL and ω-automata in batch. New automata-manipulation tools were introduced in Spot 2.0; they support arbitrary acceptance conditions, as expressible in the Hanoi Omega Automaton format. Besides being useful to researchers who have automata to process, its Python bindings can also be used in interactive environments to teach ω-automata and model checking.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Robert K. Brayton,et al.  Deterministic w Automata vis-a-vis Deterministic Buchi Automata , 1994, ISAAC.

[3]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[4]  Jean-Michel Couvreur,et al.  On-the-Fly Verification of Linear Temporal Logic , 1999, World Congress on Formal Methods.

[5]  Jørn Lind-Nielsen,et al.  BuDDy : A binary decision diagram package. , 1999 .

[6]  Emden R. Gansner,et al.  An open graph visualization system and its applications to software engineering , 2000 .

[7]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[8]  Keijo Heljanko,et al.  Testing LTL formula translation into Büchi automata , 2002, International Journal on Software Tools for Technology Transfer.

[9]  Shin Nakajima,et al.  The SPIN Model Checker : Primer and Reference Manual , 2004 .

[10]  Denis Poitrenaud,et al.  SPOT: an extensible model checking library using transition-based generalized Bu/spl uml/chi automata , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[11]  Denis Poitrenaud,et al.  On-the-Fly Emptiness Checks for Generalized Büchi Automata , 2005, SPIN.

[12]  C. Baier,et al.  Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic , 2005 .

[13]  Christel Baier,et al.  On-the-Fly Stuttering in the Construction of Deterministic ω-Automata , 2007 .

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

[15]  Brian E. Granger,et al.  IPython: A System for Interactive Scientific Computing , 2007, Computing in Science & Engineering.

[16]  W. Marsden.  I and J , 2012 .

[17]  Roman R. Redziejowski.  An Improved Construction of Deterministic Omega-automaton Using Derivatives , 2012, Fundam. Informaticae.

[18]  Jan Kretínský,et al.  Deterministic Automata for the (F,G)-fragment of LTL , 2012, CAV.

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

[20]  Fabrice Kordon,et al.  Model Checking Using Generalized Testing Automata , 2012, Trans. Petri Nets Other Model. Concurr..

[21]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

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

[23]  Fabrice Kordon,et al.  Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking , 2013, TACAS.

[24]  Jan Strejcek,et al.  Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment , 2013, ATVA.

[25]  Lukasz Fronc,et al.  LTL Model Checking with Neco , 2013, ATVA.

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

[27]  Fabrice Kordon,et al.  Three SCC-Based Emptiness Checks for Generalized Büchi Automata , 2013, LPAR.

[28]  Alfons Laarman,et al.  SpinS: Extending LTSmin with Promela through SpinJa , 2013, Electron. Notes Theor. Comput. Sci..

[29]  Souheib Baarir,et al.  Mechanizing the Minimization of Deterministic Generalized Büchi Automata , 2014, FORTE.

[30]  Alexandre Duret-Lutz,et al.  LTL translation improvements in Spot 1.0 , 2014, Int. J. Crit. Comput. Based Syst..

[31]  Alexandre Duret-Lutz,et al.  Practical Stutter-Invariance Checks for ω-Regular Languages , 2015, SPIN.

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

[33]  Yann Thierry-Mieg,et al.  Symbolic Model-Checking Using ITS-Tools , 2015, TACAS.

[35]  Jan Strejcek,et al.  On Refinement of Büchi Automata for Explicit Model Checking , 2015, SPIN.

[36]  Alfons Laarman,et al.  LTSmin: High-Performance Language-Independent Model Checking , 2015, TACAS.