On-the-Fly Emptiness Checks for Generalized Büchi Automata

Emptiness check is a key operation in the automata-theoretic approach to LTL verification. However, it is usually done on Buchi automata with a single acceptance condition. We review existing on-the-fly emptiness-check algorithms for generalized Buchi automata (i.e., with multiple acceptance conditions) and show how they compete favorably with emptiness-checks for degeneralized automata, especially in presence of weak fairness assumptions. We also introduce a new emptiness-check algorithm, some heuristics to improve existing checks, and propose algorithms to compute accepting runs in the case of multiple acceptance conditions.

[1]  Dimitra Giannakopoulou,et al.  From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata , 2002, FORTE.

[2]  Mihalis Yannakakis,et al.  On nested depth first search , 1996, The Spin Verification System.

[3]  Heikki Tauriainen,et al.  Nested emptiness search for generalized Buchi automata , 2004, Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004..

[4]  Heikki Tauriainen,et al.  ON TRANSLATING LINEAR TEMPORAL LOGIC INTO ALTERNATING AND NONDETERMINISTIC AUTOMATA , 2003 .

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

[6]  Gerard J. Holzmann,et al.  The SPIN Model Checker , 2003 .

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

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

[9]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[10]  Gerard J. Holzmann,et al.  On the Verification of Temporal Properties , 1993, PSTV.

[11]  Timo Latvala,et al.  Coping With Strong Fairness , 2000, Fundam. Informaticae.

[12]  Ivana Cerná,et al.  Relating Hierarchy of Temporal Properties to Model Checking , 2003, MFCS.

[13]  S. Anderson,et al.  Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[14]  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..

[15]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

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

[17]  Jaco Geldenhuys,et al.  More efficient on-the-fly LTL verification with Tarjan's algorithm , 2005, Theor. Comput. Sci..

[18]  Irina Virbitskaite,et al.  Analysis of Timed Concurrent Models Based on Testing Equivalence , 2000, Fundam. Informaticae.

[19]  Jaco Geldenhuys,et al.  Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient , 2004, TACAS.

[20]  Heikki Tauriainen.  A Randomized Testbench for Algorithms Translating Linear Temporal Logic Formulae into B1chi Automat , 1999 .

[21]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[22]  Javier Esparza,et al.  A Note on On-the-Fly Verification Algorithms , 2005, TACAS.

[23]  Stephan Merz,et al.  Truly On-The-Fly LTL Model Checking , 2005, TACAS.

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

[25]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[26]  Paul Gastin,et al.  Minimization of Counterexamples in SPIN , 2004, SPIN.

[27]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[28]  Roberto Grossi,et al.  Mathematical Foundations Of Computer Science 2003 , 2003 .