Abstract
Parallel finite automata is a formal model which can describe the complex control structure, but its composition model may exist redundant elements. This problem will increase the complexity of model. This paper researched the redundancy problem in the Split-Join composition of parallel finite automata and gave the condition which lead to produce redundant location and transfer. Furthermore, the algorithms which are used to eliminate the redundant location and transfer also was given. Finally, it proved the equivalence of parallel finite automata and finite automata. This conclusion ensures that he verification technology of system which base on the finite automata can be used to parallel finite automata by extension.
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
Similar content being viewed by others
References
Maneva, S., Manev, K.: Finite automata models in agro-ecosystem and plant protection. Int. J. Comput. Appl. 32(11), 1–6 (2015)
Neider, D., Jansen, N.: Regular model checking using solver technologies and automata learning. In: 6th International Proceedings on NASA Formal Method, CA, USA, pp. 16–31. Springer, Heidelberg (2013)
Armbrust, C., Kiekbusch, L., Ropertz, T., Berns, K.: Verification of behaviour networks using finite-state automata. In: German Conference on Advances in Artificial Intelligence, Koblenz, German, pp. 1–12. Springer, Heidelberg (2012)
Li, Y., Li, L.: Model checking of linear-time properties based on possibility measure. IEEE Trans. Fuzzy Syst. 21(5), 842–854 (2013)
Cambronero, M.E., DÃaz, G., Valero, V., et al.: Validation and verification of web services choreographies by using timed automata. J. Logic Algebraic Program. 80(1), 25–49 (2011)
Damm, W., Ihlemann, C., Sofronie-Stokkermans, V.: Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata. In: International Conference on Hybrid Systems: Computation and Control, Chicago, USA, pp. 73–82. ACM (2011)
Ruiz, V., Diaz, G., Cambronero, M.E.: Timed automata modeling and verification for publish-subscribe structures using distributed resources. IEEE Trans. Softw. Eng. 43(1), 76–99 (2017)
Waez, M.T.B., Dingel, J., Rudie, K.: A survey of timed automata for the development of real-time systems. Comput. Sci. Rev. 12(9), 1–26 (2013)
Delahaye, B., Katoen, J.P., Larsen, K.G., et al.: Abstract probabilistic automata. Inf. Comput. 232(6), 66–116 (2013)
Tang, Z.-Y., Wang, J.-S., Wei, L., et al.: Formal description and compatibility analysis of OWL-S process model 38(3), 478–485 (2016)
Noord, G.V.: Treatment of epsilon moves in subset construction. Comput. Linguist. 26(1), 61–76 (2000)
Acknowledgment
This work is supported by Natural Science Foundation of Fujian Province (Nos. 2016J05146 and 2016J05145), National Natural Science Foundation of China (Nos. 61402108 and 61503082), Educational Research Project for Young and Middle-Aged Teachers of Education Department of Fujian Province (No. JA15336), and Scientific Research Development Foundation of Fujian University of Technology (No. GY-Z15087).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Tang, ZY., Wang, JS., Chen, Y., Xue, XS. (2018). The Redundancy Problem in Composition of Parallel Finite Automata and Its Optimization Method. In: Krömer, P., Alba, E., Pan, JS., Snášel, V. (eds) Proceedings of the Fourth Euro-China Conference on Intelligent Data Analysis and Applications. ECC 2017. Advances in Intelligent Systems and Computing, vol 682. Springer, Cham. https://doi.org/10.1007/978-3-319-68527-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-68527-4_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68526-7
Online ISBN: 978-3-319-68527-4
eBook Packages: EngineeringEngineering (R0)