Efficient state space reduction for automata by fair simulation

Authors:
Jin Yi;Wenhui Zhang
Affiliations:
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China and Graduate University of the Chinese Academy of Sciences, Beijing, China;Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Year:
2007

Citing 7
Cited 0

Communication and Concurrency

Communication and Concurrency
Fair Simulation

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fair Simulation Minimization

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Checking for Language Inclusion Using Simulation Preorders

CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

State space reduction for automata is important to automata-theoretic model checking. Optimizing automata by simulation relation is a practical method. We propose an approach to simplify Büchi automata by fair simulation, which is based on integrating themethod of [6] and conditions of [7]. The approach can optimize an automaton without changing the language of each state and apply the optimization immediately after finding one pair of states with fair simulation equivalence. The experimental result shows our approach needs less time than that of [6].