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 the method 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].
Supported by the National Natural Science Foundation of China under Grant No. 60573012 and 60421001, and the National Grand Fundamental Research 973 Program of China under Grant No. 2002cb312200.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gastin, P., Oddoux, D.: Fast LTL to Büchi Automata Translation. In: Vardi, M.Y., Alur, R. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simulation preorders. In: Larsen, K.G., SkouLecture, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 255–265. Springer, Heidelberg (1991)
Etessami, K., Wilke, Th., Schuller, R.: Fair simulation relations, parity games, and state space reduction for Büchi automata. SIAM Journal of Computing 34(5), 1159–1175 (2005)
Henzinger, T.A., Kupferman, O., Rajamani, S.K.: Fair simulation. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 273–287. Springer, Heidelberg (1997)
Gurumurthy, S., Bloem, R., Somenzi, F.: Fair Simulation Minimization. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 610–624. Springer, Heidelberg (2002)
Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248–263. Springer, Heidelberg (2000)
Juvekar, S., Piterman, N.: Minimizing Generalized Buchi Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
Yi, J., Zhang, W.: Efficient State Space Reduction for Automata by Fair Simulation. Technical Report ISCAS-LCS-07-01, Institute of Software, Chinese Academy of Sciences
Tauriainen, H., Heljanko, K.: Testing LTL formula translation into Büchi automata. International Journal on Software Tools for Technology Transfer 4(1), 57–70 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yi, J., Zhang, W. (2007). Efficient State Space Reduction for Automata by Fair Simulation. In: Arbab, F., Sirjani, M. (eds) International Symposium on Fundamentals of Software Engineering. FSEN 2007. Lecture Notes in Computer Science, vol 4767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75698-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-75698-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75697-2
Online ISBN: 978-3-540-75698-9
eBook Packages: Computer ScienceComputer Science (R0)